login
This site is supported by donations to The OEIS Foundation.

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066386 Numbers n such that n^6+1091 is prime. 13

%I

%S 0,3906,4620,5166,5376,5460,8190,13020,13986,14490,17934,19740,19950,

%T 20664,23226,24654,29736,30114,31206,33516,33600,34104,34314,40320,

%U 41286,44016,45066,46116,47754,48300,59850,62244,63420,65310,66864

%N Numbers n such that n^6+1091 is prime.

%D D. Shanks, Solved and unsolved problems in number theory, Chelsea NY, 1985, p. 222, ex. 162.

%D D. Shanks, A low density of primes, Jour. Recreational Math. 5 (1971) 272-5.

%D David Wells, The Penguin Dictionary of Curious and Interesting Numbers, p. 151 (Rev. ed. 1997)

%D Roozbeh Hazrat, Mathematica: A Problem-Centered Approach, Springer 2010, pp. 42, 172

%H Harry J. Smith, <a href="/A066386/b066386.txt">Table of n, a(n) for n=1,...,1000</a>

%H G. L. Honaker, Jr. and Chris Caldwell, <a href="http://primes.utm.edu/curios/cpage/498.html">Prime Curios! 1091</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Prime-GeneratingPolynomial.html">Prime-Generating Polynomial</a>

%t Select[Range[100000], PrimeQ[ #^6 + 1091] &]

%o (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_, Feb 13 2010]

%Y Cf. A161998, A126893, A119276.

%K easy,nonn

%O 1,2

%A _Harvey P. Dale_, Dec 23 2001

%E 0 added by Zak Seidov, Jan 26 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified July 28 20:19 EDT 2014. Contains 245007 sequences.