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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A217884 Let c(m)=prime(m), m=1,2,3,4. For m>=5, suppose that c(m)/e is in the interval [c(k),c(k+1)). Then let c(m+1)=e*c(k+1) if e*c(k+1) < prime(m+1), and otherwise let c(m+1) = prime(m+1). Then a(n) is the n-th prime in {c(m)}. 2
 2, 3, 5, 7, 13, 19, 31, 43, 47, 67, 71, 73, 79, 83, 103, 107, 109, 113, 137, 139, 157, 163, 173, 179, 181, 197, 211, 229, 239, 241, 251, 257, 269, 271, 283, 313, 317, 337, 347, 353, 359, 367, 397, 401, 409, 419 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The preliminary sequence begins 2,3,5,7,3*e,13,5*e,19,7*e,3*e^2,31,... with terms of the form p*e^k, where p is prime, k>=0. LINKS FORMULA If A(n)is the number of terms not exceeding n, then heuristically A(n)~pi(n). Practically, an approximation is given by formula A(n) ~ n/log(n*log(n)). CROSSREFS Cf. A217689, A217691. Sequence in context: A088091 A332088 A194955 * A101045 A114847 A171969 Adjacent sequences:  A217881 A217882 A217883 * A217885 A217886 A217887 KEYWORD nonn AUTHOR Vladimir Shevelev, Oct 14 2012 EXTENSIONS Terms a(1)-a(20) confirmed and terms a(21)-a(46) added by John W. Layman, Oct 24 2012 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 December 8 14:41 EST 2021. Contains 349596 sequences. (Running on oeis4.)