1,3

There are (1, 2, 4, 7, 12,...) terms per row where (0, 0, 1, 2, 4, 7, 12,...) = A000071 = Fibonacci numbers - 1.

Row sums = A001924: (1, 3, 7, 14, 26, 46,...)

Triangle read by rows, n-th row = (n-2)-th row appended to the beginning of (n-1)-th row, + n.

First few rows of the triangle are:

1;

1, 2;

1, 1, 2, 3;

1, 2, 1, 1, 2, 3, 4;

1, 1, 2, 3, 1, 2, 1, 1, 2, 3, 4, 5;

1, 2, 1, 1, 2, 3, 4, 1, 1, 2, 3, 1, 2, 1, 1, 2, 3, 4, 5, 6;

...

Row 4 = (1, 2, 1, 1, 2, 3, 4) = (row 2 appended to row 3, + 4); = (1, 2) appended to (1, 1, 2, 3), then 4.

Cf. A000071, A001924.

Sequence in context: A037161 A133255 A145972 this_sequence A140191 A048207 A105810

Adjacent sequences: A141286 A141287 A141288 this_sequence A141290 A141291 A141292

nonn,tabf

Gary W. Adamson (qntmpkt(AT)yahoo.com), Jun 22 2008