%I A002072 M4560 N1942
%S A002072 1,8,80,4374,9800,123200,336140,11859210,11859210,177182720,1611308699,
%T A002072 3463199999,63927525375,421138799639,1109496723125,1453579866024,
%U A002072 20628591204480,31887350832896,31887350832896,119089041053696,2286831727304144,
2286831727304144,17451620110781856,166055401586083680,166055401586083680
%N A002072 a(n) = smallest number m such that for all i>m, either i or i+1 has a
prime factor > prime(n).
%D A002072 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences,
Academic Press, 1995 (includes this sequence).
%D A002072 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973
(includes this sequence).
%D A002072 E. F. Ecklund and R. B. Eggleton, Prime factors of consecutive integers,
Amer. Math. Monthly, 79 (1972), 1082-1089.
%D A002072 D. H. Lehmer, On a problem of Stormer, Ill. J. Math., 8 (1964), 57-69.
%H A002072 Don Reble, <a href="a002072.py.txt">Python program</a>
%H A002072 Wikipedia, <a href="http://en.wikipedia.org/wiki/Stormer%27s_theorem">
Stormer's Theorem</a>
%e A002072 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).
%o A002072 Program in C written by R. Gerbicz and modified by Fred Schneider.
%Y A002072 Cf. A002071, A003032, A003033. Equals A117581(n) - 1.
%Y A002072 Cf. A122463.
%Y A002072 Sequence in context: A002718 A057707 A145606 this_sequence A067449 A078292
A027768
%Y A002072 Adjacent sequences: A002069 A002070 A002071 this_sequence A002073 A002074
A002075
%K A002072 nonn,nice
%O A002072 2,2
%A A002072 N. J. A. Sloane (njas(AT)research.att.com).
%E A002072 More terms from Don Reble (djr(AT)nk.ca), Jan 11 2005
%E A002072 a(18)-a(26) from Fred Schneider (frederick.william.schneider(AT)gmail.com),
Sep 09 2006
|