This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A060197 #14 Oct 30 2022 23:04:55
%S A060197 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,
%T A060197 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,
%U A060197 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
%N A060197 Start at n, repeatedly apply pi(x) until reach 0; a(n) = number of steps to reach 0.
%C A060197 The numbers at which this sequence jumps from n to n+1 are A007097(n).
%F A060197 Table[Length[FixedPointList[PrimePi, w]]-1, {w, 1, 1000}]
%e A060197 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.
%Y A060197 Cf. A007097, A000720.
%K A060197 nonn
%O A060197 1,1
%A A060197 _Labos Elemer_, Mar 19 2001
%E A060197 Offset corrected by _Sean A. Irvine_, Oct 30 2022