|
EXAMPLE
|
a(n) counts the nodes in generation n of the following tree.
Generations 0..3 of the 6-convoluted tree are as follows;
The path from the root is shown, with child nodes enclosed in [].
GEN.0: [1];
GEN.1: 1->[6];
GEN.2: 1-6->[3,9,15,21,27,33];
GEN.3:
1-6-3->[2,8,14]
1-6-9->[2,8,14,20,26,32,38,44,50]
1-6-15->[2,8,14,20,26,32,38,44,50,56,62,68,74,80,86]
1-6-21->[2,8,14,20,26,32,38,44,50,56,62,68,74,80,86,92,98,104,110,116,122]
1-6-27->[2,8,14,20,26,32,38,44,50,56,62,68,74,80,86,92,98,104,110,116,122,128,134,140,146,152,158]
1-6-33->[2,8,14,20,26,32,38,44,50,56,62,68,74,80,86,92,98,104,110,116,122,128,134,140,146,152,158,164,170,176,182,188,194].
Each path in the tree from the root node forms the initial terms of a self-convolution 6th power of a sequence of integer terms.
|