%I #23 Apr 03 2022 10:30:39
%S 1,120,190,234,506,532,548,960,1738,1786,2884,3000,3420,3476,3658,
%T 4258,5788,6080,6562,6750,7692,8296,9108,9356,9582,9706,10238,10994,
%U 11338,11432,11466,11554,11778,12704,12766,13082,13478,13700
%N Numbers k such that k^128 + 1 is prime.
%D Dubner, Harvey. "Generalized Fermat primes." J. Recreational Math., 18 (1985): 279-280.
%H Ray Chandler, <a href="/A056994/b056994.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from T. D. Noe)
%H Yves Gallot, <a href="http://yves.gallot.pagesperso-orange.fr/primes/">Generalized Fermat Prime Search</a>.
%t Do[ k = 1; While[ PowerMod[ n, 128, 2*k*128 + 1 ] != 2*k*128 && k < 10^3, k++ ]; If[ k == 10^3 && PrimeQ[ n^128 + 1 ], Print[ n ] ], {n, 2, 15000, 2} ]
%o (PARI) isA056994(n) = isprime(n^128+1) \\ _Michael B. Porter_, Mar 30 2010
%Y Cf. A005574, A000068, A006314, A006313, A006315, A006316, A056995, A057465, A057002, A088361, A088362, A226528, A226529, A226530, A251597, A253854, A244150, A243959, A321323.
%K nonn
%O 1,2
%A _Robert G. Wilson v_, Sep 06 2000