|
|
A079487
|
|
Triangle read by rows giving Whitney numbers T(n,k) of Fibonacci lattices.
|
|
6
|
|
|
1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 2, 1, 1, 3, 3, 3, 2, 1, 1, 3, 4, 5, 4, 3, 1, 1, 4, 6, 7, 7, 5, 3, 1, 1, 4, 7, 10, 11, 10, 7, 4, 1, 1, 5, 10, 14, 17, 16, 13, 8, 4, 1, 1, 5, 11, 18, 24, 26, 24, 18, 11, 5, 1, 1, 6, 15, 25, 35, 40, 39, 32, 22, 12, 5, 1, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,8
|
|
COMMENTS
|
This is the second kind of Whitney numbers, which count elements, not to be confused with the first kind, which sum Mobius functions. - Thomas Zaslavsky, May 07 2008
|
|
LINKS
|
|
|
FORMULA
|
Define polynomials by: if k is odd then p(k, x) = x*p(k - 1, x) + p(k - 2, x); if k is even then: p(k, x) = p(k - 1, x) + x^2*p(k - 2, x). Triangle gives array of coefficients. - Roger L. Bagula, Oct 07 2006
|
|
EXAMPLE
|
Triangle begins:
{1},
{1, 1},
{1, 1, 1},
{1, 2, 1, 1},
{1, 2, 2, 2, 1},
{1, 3, 3, 3, 2, 1},
{1, 3, 4, 5, 4, 3, 1},
{1, 4, 6, 7, 7, 5, 3, 1},
{1, 4, 7, 10, 11, 10, 7, 4, 1},
{1, 5, 10, 14, 17, 16, 13, 8, 4, 1},
{1, 5, 11, 18, 24, 26, 24, 18, 11, 5, 1}
|
|
MATHEMATICA
|
p[0, x] = 1; p[1, x] = x + 1; p[k_, x_] := p[k, x] = Expand@ If[Mod[k, 2] == 1, x*p[k - 1, x] + p[k - 2, x], p[k - 1, x] + x^2*p[k - 2, x]]; Flatten[ Table[CoefficientList[p[n, x], x], {n, 0, 10}]] (* Roger L. Bagula, Oct 07 2006 *)
T[ n_, k_] := (T[n, k] = Which[k<0 || k>n, 0, k==0, 1, True, T[n-1, k-Mod[n, 2]] + T[n-2, k-Mod[n+1, 2]*2]]); (* Michael Somos, Dec 12 2023 *)
|
|
PROG
|
(PARI) {T(n, k) = if(k<0 || k>n, 0, k==0, 1, T(n-1, k-(n%2)) + T(n-2, k-(n+1)%2*2))}; /* Michael Somos, Dec 12 2023 */
|
|
CROSSREFS
|
Largest element in each row gives A077419.
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|