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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065151 a(n) = prime(1 + A064722(n)). 1
2, 2, 3, 2, 3, 2, 3, 5, 7, 2, 3, 2, 3, 5, 7, 2, 3, 2, 3, 5, 7, 2, 3, 5, 7, 11, 13, 2, 3, 2, 3, 5, 7, 11, 13, 2, 3, 5, 7, 2, 3, 2, 3, 5, 7, 2, 3, 5, 7, 11, 13, 2, 3, 5, 7, 11, 13, 2, 3, 2, 3, 5, 7, 11, 13, 2, 3, 5, 7, 2, 3, 2, 3, 5, 7, 11, 13, 2, 3, 5, 7, 2, 3, 5, 7, 11, 13, 2, 3, 5, 7, 11, 13, 17 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,1

LINKS

Harry J. Smith, Table of n, a(n) for n = 2..1000

FORMULA

a(n) = prime(PrimePi(prime(n)) - prime(PrimePi(n)) + 1) = A000040(A000720(A000040(n)) - A000040(A000720(n)) + 1).

PROG

(PARI) { for (n = 2, 1000, a=prime(n - precprime(n) + 1); write("b065151.txt", n, " ", a) ) } \\ Harry J. Smith, Oct 13 2009

CROSSREFS

Cf. A000040, A000720, A064722.

Sequence in context: A248147 A087458 A052180 * A320013 A299990 A175193

Adjacent sequences:  A065148 A065149 A065150 * A065152 A065153 A065154

KEYWORD

nonn

AUTHOR

Labos Elemer, Oct 19 2001

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 19 03:15 EDT 2019. Contains 328211 sequences. (Running on oeis4.)