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!)
A193945 Integers n such that for all i > n the largest prime factor of i(i+1)(i+2)(i+3) exceeds the largest prime factor of n(n+1)(n+2)(n+3). 4

%I #24 Feb 19 2013 04:25:14

%S 1,3,7,9,63,168,322,1518,1680,10878,17575,70224,97524,224846,612360,

%T 15473807,61011223,108384553,137308589,999208250,1497820158,

%U 22377473780,238092971076,316419292600,23931257472314

%N Integers n such that for all i > n the largest prime factor of i(i+1)(i+2)(i+3) exceeds the largest prime factor of n(n+1)(n+2)(n+3).

%C Heuristics show that these terms are valid, but a strict proof is yet to be done.

%C a(1)-a(11) verified via Størmer's theorem. - _Charles R Greathouse IV_, Feb 19 2013

%H Andrey V. Kulsha, <a href="/A193945/b193945.txt">Table of n, a(n) for n = 1..25</a>

%Y Cf. A003033, A193944, A193946, A145605.

%K nonn

%O 1,2

%A _Andrey V. Kulsha_, Aug 10 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 March 29 02:23 EDT 2024. Contains 371264 sequences. (Running on oeis4.)