cp's OEIS Frontend

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.

A163351 Triangle T(n,k) = m, 0<=k<=n, read by rows, where each decimal digit d of the integer m is the minimum of the corresponding decimal digits of n and k.

Original entry on oeis.org

0, 0, 1, 0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 6, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7, 8, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 10, 11, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 10, 11, 12, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 10
Offset: 0

Views

Author

Rick L. Shepherd, Jul 25 2009

Keywords

Comments

The number k is left-padded with zeros as necessary for comparison with n.
Clearly, for all n>=0, T(n,0) = 0 and T(n,n) = n.
For all A051885(n), T(A051885(n),k) = k; no other rows have this pattern.

Examples

			T(10,1) = 0 = a(56) as 0<1 in both tens and units positions. Sequence first differs from A002262 here.
T(104,53) = 3 as 3<4, 0<5, and 0<1.
		

Crossrefs