The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A069482

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A069482

a(n) = prime(n+1)^2 - prime(n)^2.
(history; published version)

#63 by Michel Marcus at Fri Apr 28 03:09:53 EDT 2023

STATUS

reviewed

approved

#62 by Joerg Arndt at Fri Apr 28 01:20:58 EDT 2023

STATUS

proposed

reviewed

#61 by Joerg Arndt at Fri Apr 28 01:20:52 EDT 2023

STATUS

editing

proposed

#60 by Joerg Arndt at Fri Apr 28 01:20:49 EDT 2023

COMMENTS

For n>3, a(n) mod 10 is 0,2 or 8. - Fausto Riccardo Decina, Apr 21 2023

STATUS

proposed

editing

#59 by Alois P. Heinz at Fri Apr 21 13:59:43 EDT 2023

STATUS

editing

proposed

#58 by Alois P. Heinz at Fri Apr 21 13:59:31 EDT 2023

STATUS

proposed

editing

#57 by Andrew Howroyd at Fri Apr 21 13:06:36 EDT 2023

STATUS

editing

proposed

Discussion

Fri Apr 21

13:17

Fausto Riccardo Decina: It's difficult. On prime numbers up to 1000000 the conjecture is true.

13:59

Alois P. Heinz: it is trivial ... proof is above in pink box.  I suggest to reject this trivial comment.

#56 by Andrew Howroyd at Fri Apr 21 13:06:32 EDT 2023

COMMENTS

Conjecture: For n>3, if r=(a(n) mod 10) then r= is 0,2 or 8. - Fausto Riccardo Decina, Apr 21 2023

STATUS

proposed

editing

#55 by Fausto Riccardo Decina at Fri Apr 21 12:55:24 EDT 2023

STATUS

editing

proposed

Discussion

Fri Apr 21

13:04

Andrew Howroyd: prime(n) in {1,3,7,9} mod 10, so prime(n)^2 is {1,9} mod 10 - difference of these can only be {0,2,8} mod 10. Please make an effort to prove conjectures.

#54 by Fausto Riccardo Decina at Fri Apr 21 12:55:17 EDT 2023

COMMENTS

Conjecture: For n>3, if r=(a(n) mod 10) then r=0,2 or 8. - Fausto Riccardo Decina, Apr 21 2023, Apr 21 2023