A377905 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.

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, 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, 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

Offset: 0

Author

N. J. A. Sloane, Nov 19 2024

Keywords

• nonn
• tabf

Comments

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.

Row n has sum 2*n+1.

Examples

			[See links for initial rows of the triangle]
		

Links

• N. J. A. Sloane, Rows 0 to 15
• N. J. A. Sloane, Rows 0 to 100
• N. J. A. Sloane, Naive Maple code for A329447 and the present sequence

Crossrefs

Cf. A329447.

Programs

Maple

[See link]