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

 


a(1)=2; for n>1, a(n) is the least prime q greater than p = a(n-1) such that p/q reaches a new minimum.
2

%I #11 Jan 12 2016 00:49:56

%S 2,3,5,11,29,79,223,631,1787,5077,14431,41023,116639,331651,943031,

%T 2681467,7624649,21680413,61647497,175292519,498438203,1417291781,

%U 4030020143,11459222851,32583903763,92651203181,263450491193,749112358279,2130075077051,6056794796849,17222286484817

%N a(1)=2; for n>1, a(n) is the least prime q greater than p = a(n-1) such that p/q reaches a new minimum.

%C Inspired by the fact that 294911/235927 = 1.2500095368..., two primes together with 2^16 form a primitive weird number (A002975(9729)).

%C p/q ->

%C 0.3516835469078526298668938767771073728

%C ...

%C Each pair of initial primes, p & q, will yield a different ratio.

%H Robert G. Wilson v, <a href="/A265418/b265418.txt">Table of n, a(n) for n = 1..1620</a>

%e 2/3 is 0.666... is a new low or minimum;

%e 3/5 is 0.600... is a new minimum;

%e 5/11 is 0.454... is a new minimum;

%e 11/29 is 0.379... is a new minimum;

%e 29/79 is 0.367... is a new minimum;

%e ... 6056794796849/17222286484817 is 0.351... is a new minimum; etc.

%t f[lst_List] := Block[{p = lst[[-2]], q = lst[[-1]]}, Append[lst, NextPrime[q^2/p]]]; Nest[f, {2, 3}, 29]

%K nonn

%O 1,1

%A _Robert G. Wilson v_, Dec 08 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 22 10:10 EDT 2024. Contains 376097 sequences. (Running on oeis4.)