This site is supported by donations to The OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A113118 a(1) = 2. a(n) is smallest integer > a(n-1) which is a multiple of the largest prime <= a(n-1). 2
 2, 4, 6, 10, 14, 26, 46, 86, 166, 326, 634, 1262, 2518, 5006, 10006, 19946, 39874, 79738, 159398, 318778, 637502, 1274998, 2549978, 5099902, 10199786, 20399534, 40799062, 81598082, 163196134, 326392258, 652784498, 1305568942, 2611137838 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS It appears that A113117 and this sequence agree except for the 5th term. LINKS Harvey P. Dale, Table of n, a(n) for n = 1..1000 FORMULA a(n) = 2 * (largest prime <= a(n-1)), by Bertrand's postulate. EXAMPLE The greatest prime <= a(4) (= 10) is 7. The smallest multiple of 7 which is > 10 is 14. So a(5)= 14. MATHEMATICA sim[n_]:=Module[{pr=If[PrimeQ[n], n, NextPrime[n, -1]]}, pr*( Floor[ n/pr]+1)]; NestList[ sim, 2, 40] (* Harvey P. Dale, Sep 07 2012 *) PROG (PARI) {m=33; print1(a=2, ", "); for(n=2, m, p=precprime(a); k=a+1; while(k%p>0, k++); print1(a=k, ", "))} - (Brockhaus) CROSSREFS Sequence in context: A280611 A138016 A239787 * A287636 A032417 A152415 Adjacent sequences:  A113115 A113116 A113117 * A113119 A113120 A113121 KEYWORD nonn AUTHOR Leroy Quet, Jan 03 2006 EXTENSIONS a(8) to a(33) from Klaus Brockhaus, Jan 07 2006 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 November 20 00:29 EST 2019. Contains 329323 sequences. (Running on oeis4.)