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 A096567 #43 Apr 01 2021 23:15:57
%S A096567 3,1,5,3,3,3,3,3,3,9,9,9,9,9,8,8,8,8,8,8,8,8,8,2,8,8,8,8,8,8,8,8,8,4,
%T A096567 4,4,4,4,4,8,2,2,8,2,4,4,4,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
%U A096567 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1
%N A096567 First digit to appear n times in the base-10 expansion of Pi.
%C A096567 The number 7 finally appears as a(32344). - _T. D. Noe_, Sep 13 2012
%C A096567 The number 6 appears for the first time as a(99032274). - _Kester Habermann_, Feb 01 2021
%H A096567 Jianing Song, <a href="/A096567/b096567.txt">Table of n, a(n) for n = 1..32373</a> (added to include the first occurrences of 0 and 7, first 10000 terms from T. D. Noe)
%e A096567 a(3) = 5 because 5 is the first digit to appear 3 times in the decimal expansion of Pi = 3.141(5)926(5)3(5)... - _Bobby Jacobs_, Aug 30 2017
%t A096567 nn = 1000; t = {}; d = RealDigits[Pi, 10, nn][[1]]; dCnt = Table[0, {10}]; cnt = 1; Do[b = ++dCnt[[1 + d[[n]]]]; If[b == cnt, AppendTo[t, d[[n]]]; cnt++], {n, nn}]; t (* _T. D. Noe_, Sep 13 2012 *)
%Y A096567 Cf. A000796, A014976, A053745-A053753, A096566.
%Y A096567 Cf. A195138, A195139, A195141, A280811.
%Y A096567 Cf. A276686, A276992, A276993, A277171, A291599, A291600.
%K A096567 base,nonn
%O A096567 1,1
%A A096567 _Matthew Vandermast_, Jun 26 2004
%E A096567 More terms from _David Wasserman_, Nov 16 2007