|
| |
|
|
A066386
|
|
Numbers n such that n^6+1091 is prime.
|
|
13
| |
|
|
0, 3906, 4620, 5166, 5376, 5460, 8190, 13020, 13986, 14490, 17934, 19740, 19950, 20664, 23226, 24654, 29736, 30114, 31206, 33516, 33600, 34104, 34314, 40320, 41286, 44016, 45066, 46116, 47754, 48300, 59850, 62244, 63420, 65310, 66864
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
REFERENCES
| D. Shanks, Solved and unsolved problems in number theory, Chelsea NY, 1985, p. 222, ex. 162.
D. Shanks, A low density of primes, Jour. Recreational Math. 5 (1971) 272-5.
David Wells, The Penguin Dictionary of Curious and Interesting Numbers, p. 151 (Rev. ed. 1997)
Roozbeh Hazrat, Mathematica: A Problem-Centered Approach, Springer 2010, pp. 42, 172
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=1,...,1000
G. L. Honaker, Jr. and Chris Caldwell, Prime Curios! 1091
Eric Weisstein's World of Mathematics, Prime-Generating Polynomial
|
|
|
MATHEMATICA
| Select[Range[100000], PrimeQ[ #^6 + 1091] &]
|
|
|
PROG
| (PARI) { n=0; for (m=0, 10^9, if (isprime(m^6 + 1091), write("b066386.txt", n++, " ", m); if (n==1000, return)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Feb 13 2010]
|
|
|
CROSSREFS
| Cf. A161998, A126893, A119276.
Sequence in context: A135202 A204147 A115468 * A068240 A022212 A131409
Adjacent sequences: A066383 A066384 A066385 * A066387 A066388 A066389
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Harvey P. Dale (hpd1(AT)nyu.edu), Dec 23 2001
|
|
|
EXTENSIONS
| 0 added by Zak Seidov, Jan 26 2009
|
| |
|
|
