|
Search: id:A060566
|
|
| |
|
| 1523, 1447, 1373, 1301, 1231, 1163, 1097, 1033, 971, 911, 853, 797, 743, 691, 641, 593, 547, 503, 461, 421, 383, 347, 313, 281, 251, 223, 197, 173, 151, 131, 113, 97, 83, 71, 61, 53, 47, 43, 41, 41, 43, 47, 53, 61, 71, 83, 97, 113, 131, 151, 173, 197, 223, 251
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
The formula produces primes for all values of n from 0 through 79.
First 80 prime entries are palindromically distributed because a(n) = P(x) = x^2 + x + 41, with x=n-40, and we observe that P(x) generates primes (A005846) for x = 0 through 39, along with the fact that P(-x)=P(x-1). - Lekraj Beedassy (boodhimam(AT)yahoo.com), Apr 24 2006
|
|
REFERENCES
|
C. Stanley Ogilvy and John T. Anderson, Excursions in Number Theory, Dover Publications, NY, 1966, p. 37, 147.
|
|
CROSSREFS
|
Sequence in context: A031627 A087867 A073104 this_sequence A031537 A031717 A030061
Adjacent sequences: A060563 A060564 A060565 this_sequence A060567 A060568 A060569
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Apr 11 2001
|
|
EXTENSIONS
|
Edited by njas at the suggestion of Andrew Plewe, May 16 2007
|
|
|
Search completed in 0.002 seconds
|
