login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093502 a(1) = 2; for n > 1, choose a(n) so that there are a(n-1) primes > a(n-1) and <= a(n). 0
2, 5, 19, 103, 733, 6691, 76831, 1081429, 18242699, 361919671, 8309068723, 217809953467, 6445388418589, 213232943658197, 7821073506524401 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

FORMULA

a(n) = prime(pi(a(n-1))+a(n-1)). - Vladeta Jovovic (vladeta(AT)eunet.rs), Jun 19 2004

a(1)=2, a(n) = next a(n-1)th prime after a(n-1). [From Zak Seidov (zakseidov(AT)yahoo.com), Mar 21 2009]

EXAMPLE

19 follows 5 as there are 5 primes > 5 and up to 19 inclusive, (7,11,13,17,19).

MATHEMATICA

a[1] := 2; a[n_] := Prime[PrimePi[a[n - 1]] + a[n - 1]]; Table[a[n], {n, 1, 10}] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Apr 10 2006

NestList[Prime[PrimePi[ # ] + # ] &, 2, 13] [From Zak Seidov (zakseidov(AT)yahoo.com), Mar 21 2009]

CROSSREFS

Sequence in context: A020117 A054687 A076669 * A009311 A107882 A192445

Adjacent sequences:  A093499 A093500 A093501 * A093503 A093504 A093505

KEYWORD

more,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 17 2004

EXTENSIONS

One more term from Vladeta Jovovic (vladeta(AT)eunet.rs), Jun 19 2004

More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Apr 10 2006

a(14)=6445388418589 from Zak Seidov (zakseidov(AT)yahoo.com), Mar 21 2009

a(14)-a(15) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Dec 08 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 17:11 EST 2012. Contains 205938 sequences.