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!)
A082891 Smallest prime p[j] such that quotient q[j], obtained when consecutive prime differences are divided by logarithm of smaller prime,p[j], is larger than n. 7

%I #11 Dec 11 2013 17:55:07

%S 2,7,1129,1327,19609,31397,155921,370261,1357201,2010881,20831323,

%T 20831323

%N Smallest prime p[j] such that quotient q[j], obtained when consecutive prime differences are divided by logarithm of smaller prime,p[j], is larger than n.

%C Is lim superior(q[n])=+infinity? See A082892.

%F a(n)=Min{p[x]; (p[x+1]-p[x])/log(p[x])>n}

%e n=1319945: p[n+1]=20831533, p[n]=20831323, d=210, log[20831321]=16.852, q=210/16.852=12.4615>12 and first for >11 too.

%t Do[s=(Prime[n+1]-Prime[n])/Log[Prime[n]]//N; If[s>11, Print[{n, Prime[n], Prime[n+1], s, Log[Prime[n]]//N}]], {n, 1000000, 100000000}]

%Y Cf. A082862, A082884-A082890.

%K more,nonn

%O 1,1

%A _Labos Elemer_, Apr 17 2003

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 16 13:41 EDT 2024. Contains 371713 sequences. (Running on oeis4.)