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 A329079 #12 Nov 06 2019 17:52:45 %S A329079 0,0,1,2,3,4,5,6,7,8,9,10,0,11,1,12,2,13,3,14,4,15,5,16,6,17,7,18,8, %T A329079 19,9,20,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29, %U A329079 30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50 %N A329079 a(n) is the number of entries from a(0) to a(n-2) that have the same number of digits as a(n-1), with a(0) = 0. %H A329079 Scott R. Shannon, <a href="/A329079/a329079.png">Plot of a(n) for n = 1..10000</a>. %H A329079 Scott R. Shannon, <a href="/A329079/a329079_1.png">Plot of a(n) for n = 1..1000000</a>. Note how this is self-similar to the plot for n = 1 to 10000. %e A329079 a(1) = 0 as there are no entries before a(0). %e A329079 a(2) = 1 as a(1) = 0 has one digit, and there is one previous entry before a(1) that has one digit. %e A329079 a(12) = 0 as a(11) = 10 has two digits, and there are no previous entries before a(11) that have two digits. %e A329079 a(13) = 11 as a(12) = 0 has one digit, and there are eleven previous entries before a(12) that have one digit. %Y A329079 Cf. A007953, A162146, A327246. %K A329079 nonn,base %O A329079 0,4 %A A329079 _Scott R. Shannon_, Nov 04 2019