OFFSET
0,2
COMMENTS
The paths through the tree represent integer partitions which contain their own first differences and have least part 1. These partitions are counted, including those with any least part, in A364673.
EXAMPLE
Triangle begins:
1;
2;
3, 4;
4, 5, 6, 5, 6, 8;
5, 6, 7, 8, 6, 7, 8, 10, 7, 8, 9, 12, 6, 7, 9, 10, 7, 8, 10, 12, 9, 10, 12, 16;
...
The tree starts with root 1 in row n = 0. In row n = 2 the parent node 4 has 3 children using values of k: 1, 2, and 4.
Tree begins:
row
[n]
[0] 1
|
[1] ____2____
/ \
[2] __3__ __4__
/ | \ / | \
[3] 4 5 6 5 6 8
PROG
(Python)
def A370386_rowlist(maxrow):
A, C = [[(1, )]], [[1]]
for i in range(maxrow):
A.append([])
C.append([])
for j in A[i]:
for k in j:
x = j + (j[-1] + k, )
A[i+1].append(x)
C[i+1].append(x[-1])
return(C)
CROSSREFS
KEYWORD
nonn,easy,tabf
AUTHOR
John Tyler Rascoe, Feb 28 2024
STATUS
approved