login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A003033 Smallest integer m such that the product of every 4 consecutive integers > m has a prime factor > prime(n).
(Formerly M2617)
2

%I M2617 #29 Jan 23 2015 02:37:39

%S 3,7,9,63,63,168,322,322,1518,1518,1680,10878,17575,17575,17575,17575,

%T 17575,17575,70224,70224,97524,97524,97524,97524,224846,224846,612360,

%U 612360,15473807,15473807,15473807,15473807,15473807,15473807,15473807,61011223

%N Smallest integer m such that the product of every 4 consecutive integers > m has a prime factor > prime(n).

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H E. F. Ecklund and R. B. Eggleton, <a href="http://www.jstor.org/stable/2317422">Prime factors of consecutive integers</a>, Amer. Math. Monthly, 79 (1972), 1082-1089.

%e a(3) = 3 since none of (3, 4, 5, 6) are divisible by a prime greater than prime(3) = 5 but any larger sequence of four consecutive integers is divisible by 7 or a larger prime. [_Charles R Greathouse IV_, Aug 02 2011]

%K nonn

%O 3,1

%A _N. J. A. Sloane_, _Robert G. Wilson v_

%E Corrected and extended by _Andrey V. Kulsha_, Aug 01 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)