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 A343103 #15 Apr 06 2021 03:23:07
%S A343103 0,0,0,0,0,0,0,0,0,0,10,2,2,1,2,2,2,2,2,2,19,11,16,8,8,8,9,8,12,11,11,
%T A343103 11,9,0,0,0,1,0,4,3,16,16,10,2,2,1,4,2,6,5,17,20,14,2,4,2,5,3,6,5,22,
%U A343103 25,23,8,9,9,10,6,11,11,19,27,22,5,6,7,10,6,8,9,25,33,29,11,10,12,14,9
%N A343103 a(n) is the sum of the number of times each digit in n (taken with repetition) has appeared in the sequence.
%C A343103 The fixed points > 0 in the first one million terms are 10, 101, 194. It is likely no more exist.
%H A343103 Scott R. Shannon, <a href="/A343103/a343103.png">Image of the terms for n=0..1000000</a>. The green line is a(n) = n.
%e A343103 a(0) to a(9) = 0 as the digits 0 to 9 have not appeared in the sequence.
%e A343103 a(10) = 10 as 1 has appeared zero times and 0 has appeared ten times, thus a(10) = 0 + 10 = 10.
%e A343103 a(11) = 2 as 1 has appeared once in the sequence, and as 1 appears twice in 11, a(11) = 1 + 1 = 2.
%e A343103 a(12) = 2 as 1 has appeared twice and 2 has appeared zero times, thus a(12) = 2 + 0 = 2.
%e A343103 a(20) = 19 as 2 has appeared eight times and 0 has appeared eleven times, thus a(20) = 8 + 11 = 19.
%e A343103 a(22) = 16 as 2 has appeared eight times in the sequence, and as 2 appears twice in 22, a(22) = 8 + 8 = 16.
%t A343103 Block[{a = {}, d = ConstantArray[0, 10]}, Do[AppendTo[a, Total@ Map[d[[If[# == 0, 10, #] ]] &, IntegerDigits[i]]]; Set[d, d + DigitCount[a[[i + 1]] ]], {i, 0, 87}]; a] (* _Michael De Vlieger_, Apr 05 2021 *)
%Y A343103 Cf. A343102 (count only unique digits in n), A326834, A004207, A309261, A331162.
%K A343103 nonn,base
%O A343103 0,11
%A A343103 _Scott R. Shannon_, Apr 05 2021