|
Search: id:A060197
|
|
|
| A060197 |
|
Start at n, repeatedly apply pi(x) until reach 0; a(n) = number of steps to reach 0. |
|
+0
1
|
|
| 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; listen)
|
|
|
OFFSET
|
0,1
|
|
|
FORMULA
|
Table[Length[FixedPointList[PrimePi, w]]-1, {w, 1, 1000}]
|
|
EXAMPLE
|
n=1000, the corresponding sequence of PrimePi-iteration is {1000,168,39,12,5,3,2,1,0}, whose the length is a(1000)=9. The numbers at which this sequence jumps from n to n+1 are A007097(n), terms of the primeth recurrence:1,2,3,5,11,31,127,709,5381,...
|
|
CROSSREFS
|
A007097, A000720.
Sequence in context: A088527 A030602 A133947 this_sequence A116487 A070546 A034586
Adjacent sequences: A060194 A060195 A060196 this_sequence A060198 A060199 A060200
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Mar 19 2001
|
|
|
Search completed in 0.002 seconds
|
