|
Search: id:A002587
|
|
|
| A002587 |
|
Largest prime factor of 2^n + 1.
(Formerly M2386 N0948)
|
|
+0
4
|
|
| 3, 5, 3, 17, 11, 13, 43, 257, 19, 41, 683, 241, 2731, 113, 331, 65537, 43691, 109, 174763, 61681, 5419, 2113, 2796203, 673, 4051, 1613, 87211, 15790321, 3033169, 1321, 715827883, 6700417, 20857, 26317, 86171, 38737, 25781083, 525313
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
E. Lucas, Theorie des fonctions numeriques simplement periodiques, Amer. J. Math., 1 (1878), 184-239, 289-321.
M. Kraitchik, Recherches sur la Th\'{e}orie des Nombres. Gauthiers-Villars, Paris, Vol. 1, 1924, Vol. 2, 1929, see Vol. 2, p. 85.
J. Brillhart et al., Factorizations of b^n +- 1. Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 2nd edition, 1985; and later supplements.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..500 (using data from A001269)
S. S. Wagstaff, Jr., The Cunningham Project
J. Brillhart et al., Factorizations of b^n +- 1, Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 3rd edition, 2002.
D. X. Charles, The abc-Conjecture And The Largest Prime Factor Of 2^n + 1
|
|
CROSSREFS
|
Cf. A002586.
Adjacent sequences: A002584 A002585 A002586 this_sequence A002588 A002589 A002590
Sequence in context: A121278 A023587 A002586 this_sequence A066845 A014782 A094466
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Jul 06 2000
|
|
|
Search completed in 0.002 seconds
|
