|
Search: id:A116669
|
|
|
| A116669 |
|
Triangle, rows tend to A001787, number of edges in n-dimensional hypercubes. |
|
+0
1
|
|
| 1, 1, 1, 1, 4, 1, 1, 4, 7, 1, 1, 4, 12, 10, 1, 1, 4, 12, 25, 13, 1, 1, 4, 12, 32, 43, 16, 1, 1, 4, 12, 32, 71, 66, 19, 1, 1, 4, 12, 32, 80, 136, 94, 22, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
Rows tend to A001787: 1, 4, 12, 32, 80, 192, 448...(number of edges in n-dimensional hypercubes). First difference terms of the triangle columns become rows of the triangle A116666.
|
|
FORMULA
|
Construct an array formed by taking binomial transforms of (1,0,0,0...); (1,3,0,0,0...); (1,3,5,0,0,0). Antidiagonals of the array become rows of the triangle.
|
|
EXAMPLE
|
First few rows of the array are:
1 1 1 1 1...
1 4 7 10 13...
1 4 12 25 43...
1 4 12 32 71...
...
By taking antidiagonals, first few rows of the triangle are:
1;
1, 1;
1, 4, 1;
1, 4, 7, 1;
1, 4, 12, 10, 1;
1, 4, 12, 25, 13, 1;
...
|
|
CROSSREFS
|
Cf. A001787, A116666, A116668.
Sequence in context: A106314 A110812 A091570 this_sequence A016523 A026998 A080061
Adjacent sequences: A116666 A116667 A116668 this_sequence A116670 A116671 A116672
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Gary W. Adamson (qntmpkt(AT)yahoo.com), Feb 22 2006
|
|
|
Search completed in 0.002 seconds
|
