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 A008829 N1424 #31 Sep 18 2021 01:54:25
%S A008829 1,4,15,92,653,5897,9323,84626,433832,795028,841971,6939937,51058209,
%T A008829 74944592,307816406,2862089986,28034825342,1170679821480,
%U A008829 8651328230664,70938446095505,82231725359408,128481117450284,1027019385211055
%N A008829 Smallest number a(n) formed from consecutive sequences of digits of Pi and satisfying a(n) > a(n-1); first 3 is omitted.
%C A008829 Terms are not permitted to start with a 0, so when this would otherwise occur the 0 must be included in the previous term, for example, a(18). - _Sean A. Irvine_, Apr 07 2018
%D A008829 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%H A008829 Sean A. Irvine, <a href="/A008829/b008829.txt">Table of n, a(n) for n = 1..250</a>
%t A008829 pi = Rest@ RealDigits[Pi, 10, 2500][[1]]; a[0] = 0; a[n_] := a[n] = Block[{k = 1}, While[ FromDigits[ Take[pi, {1, k}]] < a[n - 1], k++]; While[ pi[[k + 1]] == 0, k++]; b = FromDigits[Take[pi, {1, k}]]; pi = Drop[pi, k]; b]; Array[a, 50] (* _Robert G. Wilson v_, Apr 08 2018 *)
%Y A008829 Cf. A000796. Apart from the two initial terms equals A016062.
%K A008829 nonn,base
%O A008829 1,2
%A A008829 _N. J. A. Sloane_. This sequence appeared in the 1973 "Handbook", but was then dropped from the database. Resubmitted by Victor H. Auerbach (vhambler(AT)voicenet.com). Entry revised by _N. J. A. Sloane_, Jun 11 2012
%E A008829 a(19)-a(20) corrected and more terms from _Sean A. Irvine_, Apr 07 2018