This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A066386 #21 Feb 16 2025 08:32:45
%S A066386 0,3906,4620,5166,5376,5460,8190,13020,13986,14490,17934,19740,19950,
%T A066386 20664,23226,24654,29736,30114,31206,33516,33600,34104,34314,40320,
%U A066386 41286,44016,45066,46116,47754,48300,59850,62244,63420,65310,66864
%N A066386 Numbers k such that k^6 + 1091 is prime.
%D A066386 D. Shanks, Solved and unsolved problems in number theory, Chelsea NY, 1985, p. 222, ex. 162.
%D A066386 D. Shanks, A low density of primes, Jour. Recreational Math. 5 (1971) 272-5.
%D A066386 David Wells, The Penguin Dictionary of Curious and Interesting Numbers, p. 151 (Rev. ed. 1997)
%D A066386 Roozbeh Hazrat, Mathematica: A Problem-Centered Approach, Springer 2010, pp. 42, 172
%H A066386 Harry J. Smith, <a href="/A066386/b066386.txt">Table of n, a(n) for n = 1..1000</a>
%H A066386 G. L. Honaker, Jr. and Chris Caldwell, <a href="https://t5k.org/curios/cpage/498.html">Prime Curios! 1091</a>
%H A066386 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Prime-GeneratingPolynomial.html">Prime-Generating Polynomial</a>
%t A066386 Select[Range[100000], PrimeQ[ #^6 + 1091] &]
%o A066386 (PARI) { n=0; for (m=0, 10^9, if (isprime(m^6 + 1091), write("b066386.txt", n++, " ", m); if (n==1000, return)) ) } \\ _Harry J. Smith_, Feb 13 2010
%Y A066386 Cf. A161998, A126893, A119276.
%K A066386 easy,nonn
%O A066386 1,2
%A A066386 _Harvey P. Dale_, Dec 23 2001
%E A066386 0 added by Zak Seidov, Jan 26 2009