A339379 Irregular triangle read by rows; the first row simply contains the value 1; given the succession of digits of the n-th row, say [d_0, ..., d_k], the (n+1)-th row is the succession of digits of [d_0, d_0+d_1, d_1+d_2, ..., d_{k-1}+d_k, d_k].
1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 6, 4, 1, 1, 5, 1, 0, 1, 0, 5, 1, 1, 6, 6, 1, 1, 1, 5, 6, 1, 1, 7, 1, 2, 7, 2, 2, 6, 1, 1, 7, 1, 1, 8, 8, 3, 9, 9, 4, 8, 7, 2, 8, 8, 1, 1, 9, 1, 6, 1, 1, 1, 2, 1, 8, 1, 3, 1, 2, 1, 5, 9, 1, 0, 1, 6, 9, 1
Offset: 0
Examples
The first rows are:
1
1, 1
1, 2, 1
1, 3, 3, 1
1, 4, 6, 4, 1
1, 5, 1, 0, 1, 0, 5, 1
1, 6, 6, 1, 1, 1, 5, 6, 1
1, 7, 1, 2, 7, 2, 2, 6, 1, 1, 7, 1
1, 8, 8, 3, 9, 9, 4, 8, 7, 2, 8, 8, 1
1, 9, 1, 6, 1, 1, 1, 2, 1, 8, 1, 3, 1, 2, 1, 5, 9, 1, 0, 1, 6, 9, 1
Links
- Alois P. Heinz, Rows n = 0..30, flattened
Programs
-
Mathematica
NestList[Flatten[IntegerDigits[Map[Total, Partition[#, 2, 1, {-1, 1}, 0]]]] &, {1}, 10] (* Paolo Xausa, Aug 19 2025 *) -
PARI
{ r = [1]; for (n=0, 9, apply (v -> print1 (v ", "), r); d = concat(apply(v -> if (v, digits(v), [0]), r)); r = concat(apply(v -> if (v, di gits(v), [0]), vector(#d+1, k, if (k==1, d[k], k==#d+1, d[#d], d[k-1]+d[k]))))) }
Comments