A293959 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A293959

Construct a triangle T(n,k) (0 <= k <= n) of strings of integers, where T(0,0) = {0}, T(n,n) = {n}, and otherwise T(n,k) is the concatenation of T(n-1,k-1) and T(n-1,k). The sequence is obtained by reading across the rows of the triangle, concatenating the successive strings.

0, 0, 1, 0, 0, 1, 2, 0, 0, 0, 1, 0, 1, 2, 3, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 2, 0, 1, 2, 3, 4, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 2, 0, 0, 1, 0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4, 5, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 2, 0, 0, 0, 1, 0, 0, 1, 0, 1, 2, 0, 0, 1, 0, 1, 2, 0, 1, 2, 3, 0, 0, 1, 0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,7

COMMENTS

The string T(n,k) contains binomial(n,k) numbers.

LINKS

Table of n, a(n) for n=0..119.

EXAMPLE

The first few rows of the triangle (where the strings T(n,k) are shown without spaces for legibility) are:

0,1,

0,01,2,

0,001,012,3,