|
Search: id:A002072
|
|
|
| A002072 |
|
a(n) = smallest number m such that for all i>m, either i or i+1 has a prime factor > prime(n).
(Formerly M4560 N1942)
|
|
+0
6
|
|
| 1, 8, 80, 4374, 9800, 123200, 336140, 11859210, 11859210, 177182720, 1611308699, 3463199999, 63927525375, 421138799639, 1109496723125, 1453579866024, 20628591204480, 31887350832896, 31887350832896, 119089041053696, 2286831727304144, 2286831727304144, 17451620110781856, 166055401586083680, 166055401586083680
(list; graph; listen)
|
|
|
OFFSET
|
2,2
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
E. F. Ecklund and R. B. Eggleton, Prime factors of consecutive integers, Amer. Math. Monthly, 79 (1972), 1082-1089.
D. H. Lehmer, On a problem of Stormer, Ill. J. Math., 8 (1964), 57-69.
|
|
LINKS
|
Don Reble, Python program
Wikipedia, Stormer's Theorem
|
|
EXAMPLE
|
166055401586083681=7^2*17^10*41^2, 166055401586083680=2^5*3^3*5*11^3*23*43*59*67*83*89 This number appears twice because there is no pair of numbers with max. factor = 97 that is larger than this number (through 2^62 anyway).
|
|
PROGRAM
|
Program in C written by R. Gerbicz and modified by Fred Schneider.
|
|
CROSSREFS
|
Cf. A002071, A003032, A003033. Equals A117581(n) - 1.
Cf. A122463.
Sequence in context: A002718 A057707 A145606 this_sequence A067449 A078292 A027768
Adjacent sequences: A002069 A002070 A002071 this_sequence A002073 A002074 A002075
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Don Reble (djr(AT)nk.ca), Jan 11 2005
a(18)-a(26) from Fred Schneider (frederick.william.schneider(AT)gmail.com), Sep 09 2006
|
|
|
Search completed in 0.002 seconds
|
