|
|
EXAMPLE
| a(n) counts the nodes in generation n of the following tree.
Generations 0..5 of the 2-convoluted tree are as follows;
The path from the root is shown, with child nodes enclosed in [].
GEN.0: [1];
GEN.1: 1->[2];
GEN.2: 1-2->[1,3];
GEN.3:
1-2-1->[2]
1-2-3->[2,4,6];
GEN.4:
1-2-1-2->[2,4]
1-2-3-2->[1,3]
1-2-3-4->[1,3,5,7]
1-2-3-6->[1,3,5,7,9,11];
GEN.5:
1-2-1-2-2->[2,4]
1-2-1-2-4->[2,4,6,8]
1-2-3-2-1->[2]
1-2-3-2-3->[2,4,6]
1-2-3-4-1->[2]
1-2-3-4-3->[2,4,6]
1-2-3-4-5->[2,4,6,8,10]
1-2-3-4-7->[2,4,6,8,10,12,14]
1-2-3-6-1->[2]
1-2-3-6-3->[2,4,6]
1-2-3-6-5->[2,4,6,8,10]
1-2-3-6-7->[2,4,6,8,10,12,14]
1-2-3-6-9->[2,4,6,8,10,12,14,16,18]
1-2-3-6-11->[2,4,6,8,10,12,14,16,18,20,22].
Each path in the tree from the root node forms the initial terms of a self-convolution square of a sequence with integer terms.
|
