|
Search: id:A081447
|
|
|
| A081447 |
|
Smallest squares such that partial sums of the sequence plus 5 are primes. |
|
+0
4
|
|
| 36, 576, 36, 144, 144, 36, 36, 36, 144, 36, 144, 36, 144, 144, 36, 144, 36, 36, 324, 36, 324, 144, 900, 144, 576, 324, 576, 36, 144, 324, 900, 36, 1764, 36, 36, 36, 144, 2304, 36, 2304, 324, 36, 144, 4356, 144, 900, 900, 900, 1296, 36, 36, 144, 324, 36, 144
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Members are of the form (6m)^2, m integer (A081448). Proof: Since primes are 6k+1,6k+5, squares must be 6k,6k+2. The latter squares do not exist.
|
|
PROGRAM
|
(PARI) t=5:for(n=2, 100, for(k=1, 10^8, if(isprime(k^2+t), print1(k^2", "):t=t+k^2:break)))
|
|
CROSSREFS
|
Cf. A081445, A081449.
Sequence in context: A090408 A008657 A134289 this_sequence A099764 A003841 A126926
Adjacent sequences: A081444 A081445 A081446 this_sequence A081448 A081449 A081450
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Ralf Stephan (ralf(AT)ark.in-berlin.de), Mar 21 2003
|
|
|
Search completed in 0.002 seconds
|
