A377905 - OEIS

%I #24 Nov 20 2024 08:52:36

%S 1,2,1,2,3,3,3,1,3,4,2,3,4,4,4,4,4,1,4,5,4,2,4,5,5,3,4,5,5,5,5,5,5,5,

%T 1,5,6,5,5,2,5,6,6,5,3,5,6,6,6,4,5,6,6,6,6,6,6,6,6,6,1,6,7,6,6,6,2,6,

%U 7,7,6,6,3,6,7,7,7,6,4,6,7,7,7,7,5,6,7,7,7,7,7,7,7,7,7,7,7,1,7,8,7,7,7,7,2,7,8,8,7,7,7,3,7,8,8,8,7,7,4,7,8,8,8,8,7

%N Irregular triangle read by rows: T(n,k) (n >= 0, k >= 0, T[n,k]>0) is the total number of occurrences of the digit k in terms 0 to n of A329447.

%C A329447(n) is constructed by finding the smallest number in row n-1 of this triangle, and in case of a tie, choosing the leftmost. If this is an entry c in column d, then A329447(n) = 10*c+d.

%C Row n has sum 2*n+1.

%H N. J. A. Sloane, <a href="/A377905/a377905.jpg">Rows 0 to 15</a>

%H N. J. A. Sloane, <a href="/A377905/a377905.txt">Rows 0 to 100</a>

%H N. J. A. Sloane, <a href="/A377905/a377905_1.txt">Naive Maple code for A329447 and the present sequence</a>

%e [See links for initial rows of the triangle]

%p [See link]

%Y Cf. A329447.

%K nonn,tabf

%O 0,2

%A _N. J. A. Sloane_, Nov 19 2024