OFFSET
1,3
COMMENTS
The next level gets created from each node by adding one or two more nodes. If a single node is added, its value is one more than the value of its parent. If two nodes are added, the first is equal in value to the parent and the value of the second is one more than the value of the parent.
Sequence A036043 counts the parts of numeric partitions and contains the same values on each row as the current sequence. When a node generates two branches the first branch can be mapped to cyclic partitions; all other branches map to matching partitions.
Appears to be the triangle in which the n-th row contains the number of parts of each partition of n, where the partitions are ordered as in A080577. - Jason Kimberley, May 12 2010
LINKS
EXAMPLE
The values at level three are 1, 2, and 3.
The 1 generates 1 and 2; the 2 generates 2 and 3; the 3 only generates 4.
The array begins
1
1 2
1 2 3
1 2 2 3 4
1 2 2 3 3 4 5
1 2 2 3 2 3 4 3 4 5 6
MATHEMATICA
Flatten[Table[Length /@ IntegerPartitions[n], {n, 9}]] (* T. D. Noe, Feb 27 2014 *)
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Alford Arnold, Mar 27 2007, Aug 01 2007
STATUS
approved