The OEIS is supported by the many generous donors to the OEIS 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A072928 Let p_0(n) := the n-th prime number, taking the first prime number to be 2; p_[i+1](n) = p_i(p_i(n)); then a(n) := p_n(1). 0
 2, 3, 11, 5381, 75063692618249 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS FORMULA p_0(n) := the n-th prime number, taking the first prime number to be 2 p_[i+1](n) := p_i(p_i(n)) a(n) := p_n(1) EXAMPLE a(1)=3 because p_1(1)=p_0(p_0(1))=p_0(2)=3. CROSSREFS Cf. A007097. Sequence in context: A211349 A096456 A262201 * A140970 A058523 A103782 Adjacent sequences: A072925 A072926 A072927 * A072929 A072930 A072931 KEYWORD nonn AUTHOR Anonymous, Aug 12 2002 STATUS approved

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

Last modified December 9 09:46 EST 2022. Contains 358700 sequences. (Running on oeis4.)