|
Search: id:A130831
|
|
|
| A130831 |
|
Irregular triangle read by rows: row(1) = [1,2]; thereafter row(n+1) is the tensor square of row(n). |
|
+0
2
|
|
| 1, 2, 1, 2, 2, 4, 1, 2, 2, 4, 2, 4, 4, 8, 2, 4, 4, 8, 4, 8, 8, 16, 1, 2, 2, 4, 2, 4, 4, 8, 2, 4, 4, 8, 4, 8, 8, 16, 2, 4, 4, 8, 4, 8, 8, 16, 4, 8, 8, 16, 8, 16, 16, 32, 2, 4, 4, 8, 4, 8, 8, 16, 4, 8, 8, 16, 8, 16, 16, 32, 4, 8, 8, 16, 8, 16, 16, 32, 8, 16, 16, 32, 16, 32, 32, 64, 2, 4, 4, 8, 4, 8, 8, 16
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Self-similar recursion based number set {1,2}.
Row lengths are A001146. These are the kind of numbers encountered when making self-similar fractals by levels.
|
|
EXAMPLE
|
Triangle begins:
{1, 2},
{1, 2, 2, 4},
{1, 2, 2, 4, 2, 4, 4, 8, 2, 4, 4, 8, 4, 8, 8, 16}
...
|
|
MATHEMATICA
|
a[1] = {1, 2}; a[2] = {1, 2, 2, 4}; a[n_] := a[n] = Flatten[Table[a[n - 1][[m]]*a[n - 1], {m, 1, Length[a[n - 1]]}]]; w = Table[a[n], {n, 1, 4}]; Flatten[w]
|
|
CROSSREFS
|
Cf. A001146, A060803, A130830.
Adjacent sequences: A130828 A130829 A130830 this_sequence A130832 A130833 A130834
Sequence in context: A078660 A060177 A048896 this_sequence A131097 A062790 A046640
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Aug 20 2007
|
|
EXTENSIONS
|
Edited by njas, Jun 07 2008
|
|
|
Search completed in 0.002 seconds
|
