|
Search: id:A158860
|
|
|
| A158860 |
|
Start 3*n-2 Coxeter recursion sequence: e(n,k)= (e(n - 1, k)*e(n, k - 1) + 1)/e(n - 1, k - 1). |
|
+0
1
|
|
| 1, 4, 1, 7, 2, 1, 10, 3, 2, 1, 13, 4, 3, 2, 1, 16, 5, 4, 3, 2, 1, 19, 6, 5, 4, 3, 2, 1, 22, 7, 6, 5, 4, 3, 2, 1, 25, 8, 7, 6, 5, 4, 3, 2, 1, 28, 9, 8, 7, 6, 5, 4, 3, 2, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Row sums are:
{1, 5, 10, 16, 23, 31, 40, 50, 61, 73,...}.
|
|
REFERENCES
|
H. S. M. Coxeter, Regular Polytopes, 3rd ed., Dover, NY, 1973, pp 159-162.
|
|
FORMULA
|
e(n,k)= (e(n - 1, k)*e(n, k - 1) + 1)/e(n - 1, k - 1).
|
|
EXAMPLE
|
{1},
{4, 1},
{7, 2, 1},
{10, 3, 2, 1},
{13, 4, 3, 2, 1},
{16, 5, 4, 3, 2, 1},
{19, 6, 5, 4, 3, 2, 1},
{22, 7, 6, 5, 4, 3, 2, 1},
{25, 8, 7, 6, 5, 4, 3, 2, 1},
{28, 9, 8, 7, 6, 5, 4, 3, 2, 1}
|
|
MATHEMATICA
|
Clear[e, n, k];
e[n_, 0] := 3*n - 2;
e[n_, k_] := 0 /; k >= n;
e[n_, k_] := (e[n - 1, k]*e[n, k - 1] + 1)/e[n - 1, k - 1];
Table[Table[e[n, k], {k, 0, n - 1}], {n, 1, 10}];
Flatten[%]
|
|
CROSSREFS
|
A130303
Sequence in context: A046551 A065814 A050356 this_sequence A037022 A037023 A143971
Adjacent sequences: A158857 A158858 A158859 this_sequence A158861 A158862 A158863
|
|
KEYWORD
|
nonn,tabl,uned
|
|
AUTHOR
|
Roger L. Bagula and Gary W. Adamson (rlbagulatftn(AT)yahoo.com), Mar 28 2009
|
|
|
Search completed in 0.002 seconds
|
