|
Search: id:A056995
|
|
|
| A056995 |
|
Numbers n such that n^256 + 1 is prime. |
|
+0
18
|
|
| 1, 278, 614, 892, 898, 1348, 1494, 1574, 1938, 2116, 2122, 2278, 2762, 3434, 4094, 4204, 4728, 5712, 5744, 6066, 6508, 6930, 7022, 7332, 8524, 8644, 8762, 8808, 9024, 9142, 9412, 10892, 12206, 13220, 13222, 13246, 13370, 13738, 14114, 14930
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000 (from Yves Gallot)
Yves Gallot, Generalized Fermat Prime Search.
|
|
MATHEMATICA
|
Do[ k = 1; While[ PowerMod[ n, 256, 2*k*256 + 1 ] != 2*k*256 && k < 10^3, k++ ]; If[ k == 10^3 && PrimeQ[ n^256 + 1 ], Print[ n ] ], {n, 2, 15000, 2} ]
|
|
CROSSREFS
|
Cf. A005574, A000068, A006314, A006313, A006315, A006316, A056994, A057465, A057002, A088361, A088362
Sequence in context: A105977 A048525 A154231 this_sequence A062384 A053345 A032505
Adjacent sequences: A056992 A056993 A056994 this_sequence A056996 A056997 A056998
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com), Sep 06 2000
|
|
|
Search completed in 0.002 seconds
|
