The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A137368 a(n) = least m such that sum of m reciprocal primes starting with n-th prime is >1. 1
 3, 9, 27, 66, 144, 253, 424, 651, 977, 1392, 1866, 2479, 3169, 3981, 4978, 6137, 7420, 8829, 10477, 12279, 14295, 16613, 19124, 21906, 24904, 28056, 31494, 35320, 39486, 44102, 49116, 54103, 59468, 65143, 71315, 77649, 84504, 91720, 99303, 107365 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS FORMULA a(n)=m: sum(1/prime(i), i=n,n+m-1))>1, while sum(1/prime(i), i=n,n+m-2))<1. EXAMPLE a(1)=3 because 1/2+1/3+1/5=31/30 (3 terms), while 1/2+1/3<1, a(2)=9 because 1/3+1/5+1/7+1/11+1/13+1/17+1/19+1/23+1/29 =3343015913/3234846615 (9 terms), while 1/3+...+1/23<1, a(3)=27 because 1/p(3)+...1/p(29)>1 (27 terms) while 1/p(3)+...1/p(28)<1. MATHEMATICA ss={}; Do[s=1/Prime[n]; k=1; While[s<1, k++; s+=1/Prime[n+k-1]]; AppendTo[ss, k], {n, 1, 30}] CROSSREFS Sequence in context: A274626 A161712 A280466 * A191007 A036215 A103828 Adjacent sequences:  A137365 A137366 A137367 * A137369 A137370 A137371 KEYWORD nonn AUTHOR Zak Seidov, Apr 09 2008 EXTENSIONS a(31)-a(40) from Donovan Johnson, Sep 05 2008 STATUS approved

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

Last modified August 10 06:42 EDT 2020. Contains 336368 sequences. (Running on oeis4.)