|
%I M1027 N0386 #64 Mar 31 2022 02:18:54
%S 1,2,4,6,16,20,24,28,34,46,48,54,56,74,80,82,88,90,106,118,132,140,
%T 142,154,160,164,174,180,194,198,204,210,220,228,238,242,248,254,266,
%U 272,276,278,288,296,312,320,328,334,340,352,364,374,414,430,436,442,466
%N Numbers k such that k^4 + 1 is prime.
%D Harvey Dubner, Generalized Fermat primes, J. Recreational Math., 18 (1985): 279-280.
%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H T. D. Noe, <a href="/A000068/b000068.txt">Table of n, a(n) for n = 1..10000</a>
%H R. K. Guy, <a href="/A005165/a005165.pdf">The strong law of small numbers</a>. Amer. Math. Monthly 95 (1988), no. 8, 697-712. [Annotated scanned copy]
%H M. Lal, <a href="http://dx.doi.org/10.1090/S0025-5718-1967-0222007-9">Primes of the form n^4 + 1</a>, Math. Comp., 21 (1967), 245-247.
%H D. Shanks, <a href="http://dx.doi.org/10.1090/S0025-5718-1961-0120184-6">On numbers of the form n^4+1</a>, Math. Comp. 15 (74) (1961), 186-189.
%t Select[Range[10^2*2], PrimeQ[ #^4+1] &] (* _Vladimir Joseph Stephan Orlovsky_, May 01 2008 *)
%o (PARI) {a(n) = local(m); if( n<1, 0, for(k=1, n, until( isprime(m^4 + 1), m++)); m)};
%o (PARI) list(lim)=my(v=List([1])); forstep(k=2,lim,2, if(isprime(k^4+1), listput(v,k))); Vec(v) \\ _Charles R Greathouse IV_, Mar 31 2022
%o (Magma) [n: n in [0..800] | IsPrime(n^4+1)]; // _Vincenzo Librandi_, Nov 18 2010
%Y Cf. A002523, A037896, A005574, A006314, A006313, A006315, A006316, A056994, A056995, A057465, A057002, A088361, A088362, A226528, A226529, A226530, A251597, A253854, A244150, A243959, A321323.
%K nonn,easy
%O 1,2
%A _N. J. A. Sloane_
|
