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!)
 A060197 Start at n, repeatedly apply pi(x) until reach 0; a(n) = number of steps to reach 0. 3
 2, 3, 4, 4, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The numbers at which this sequence jumps from n to n+1 are A007097(n). LINKS FORMULA Table[Length[FixedPointList[PrimePi, w]]-1, {w, 1, 1000}] EXAMPLE For n=1000, the corresponding sequence of PrimePi-iteration is {1000,168,39,12,5,3,2,1,0}, whose length is a(1000)=9. CROSSREFS Cf. A007097, A000720. Sequence in context: A030602 A133947 A082090 * A116487 A249041 A070546 Adjacent sequences: A060194 A060195 A060196 * A060198 A060199 A060200 KEYWORD nonn AUTHOR Labos Elemer, Mar 19 2001 EXTENSIONS Offset corrected by Sean A. Irvine, Oct 30 2022 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 November 30 19:14 EST 2022. Contains 358453 sequences. (Running on oeis4.)