|
Search: id:A158753
|
|
|
| A158753 |
|
Lucas even count down recursion:e(n,k)=(e(n - 1, k)*e(n, k - 1) + 1)/e(n - 1, k - 1) |
|
+0
2
|
|
| 1, 4, 1, 11, 4, 1, 29, 11, 4, 1, 76, 29, 11, 4, 1, 199, 76, 29, 11, 4, 1, 521, 199, 76, 29, 11, 4, 1, 1364, 521, 199, 76, 29, 11, 4, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
2,2
|
|
|
COMMENT
|
Really slow backward recursion in Mathematica.
Row sums are:A004146;
{1, 5, 16, 45, 121,320, 841, 2205,...}.
|
|
REFERENCES
|
H. S. M. Coxeter, Regular Polytopes, 3rd ed., Dover, NY, 1973, pp 159-162
|
|
FORMULA
|
Every other result is a beta integer ( odd Phi factors, even Integers): e(n,k)=(e(n - 1, k)*e(n, k - 1) + 1)/e(n - 1, k - 1)
|
|
EXAMPLE
|
{1},
{4, 1},
{11, 4, 1},
{29, 11, 4, 1},
{76, 29, 11, 4, 1},
{199,76, 29, 11, 4, 1},
{521,199,76, 29, 11, 4, 1},
{1364,521,199,76, 29, 11, 4, 1}
|
|
MATHEMATICA
|
Clear[e, n, k];
e[n_, 0] := GoldenRatio^n - GoldenRatio^(-n);
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[ Rationalize[N[e[n, k]]], {k, Mod[n, 2] + 1, n - 1, 2}], {n, 2, 16, 2}];
Flatten[%]
|
|
CROSSREFS
|
A002878, A004146
Sequence in context: A124324 A094503 A113897 this_sequence A135552 A109088 A060923
Adjacent sequences: A158750 A158751 A158752 this_sequence A158754 A158755 A158756
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Roger L. Bagula and Gary W. Adamson (rlbagulatftn(AT)yahoo.com), Mar 25 2009
|
|
|
Search completed in 0.002 seconds
|
