A129718: Triangle read by rows: T(n,k) is the number of Fibonacci binary words of length n and having k runs of 1's (n >= 0, 0 <= k <= floor((n+1)/2)). A Fibonacci binary word is a binary word having no 00 subword. A run of 1's is a maximal subword of the form 11..1.

A129718 ↗ nonnegative coefficients

Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)

Recurrence from A129718

\(\left(-2 + n\right)\,P_{n}(x) = \left(-2 + n\right)\,P_{n-1}(x) + \left(-2\,x + n x\right)\,P_{n-2}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1 + x\)
\(P_{2}(x) = 3\,x\)

Rows ?

nx0x1x2x3x4Pn(1)
011
1112
2033
30415
40448
5048113
60412521
7041613134
Technical details
Node id
n-8c1a47047f1958de · revision 0 · JSON
Definition source
oeis_catalog:A129718
Fingerprint
f6-ae9974fb5cf108aa

Observed on the stored rows ?

  • Degrees: 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7 (half affine: slope 1, intercept 1)
  • Palindromic rows: no
  • γ-positive (gamma_positive): no
  • Nonnegative coefficients (nonn): yes
  • Only rational roots (rr_by_factors: every nonzero row is a product of linear factors over ℚ): no

Matches ?

  • A129718 triangle 71 terms, 15 rows · tabf · nonn · catalog b-file?

Row sums ? A202278, A248740, A274163, A185357, A077373, A000045, A212804, A132636

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0: 1;
  1: 1, 1;
  2: 0, 3;
  3: 0, 4,  1;
  4: 0, 4,  4;
  5: 0, 4,  8,  1;
  6: 0, 4, 12,  5;
  7: 0, 4, 16, 13,  1;
  8: 0, 4, 20, 25,  6;
  9: 0, 4, 24, 41, 19, 1;
%F Formula
The row polynomials satisfy (n-2)*P(n,x) = (n-2)*P(n-1,x) + (n-2)*x*P(n-2,x) for n >= 3, with P(0,x) = 1, P(1,x) = 1 + x, P(2,x) = 3*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 1 + x;
P[2, x_] := 3*x;
P[n_, x_] := P[n, x] = Expand[Together[((n - 2)*P[n - 1, x] + (n - 2)*x*P[n - 2, x])/(n - 2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + x; v[3] = 3*x; for(n = 3, N, my(i = n + 1); v[i] = ((n - 2)*v[i - 1] + (n - 2)*x*v[i - 2])/(n - 2)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)

polytool c48629374597

A129718 triangle, offset 0, from P0
%e Example
Triangle begins:
  0: 1;
  1: 1, 1;
  2: 0, 3;
  3: 0, 4,  1;
  4: 0, 4,  4;
  5: 0, 4,  8,  1;
  6: 0, 4, 12,  5;
  7: 0, 4, 16, 13,  1;
  8: 0, 4, 20, 25,  6;
  9: 0, 4, 24, 41, 19, 1;
%F Formula
The row polynomials satisfy (n-2)*P(n,x) = (n-2)*P(n-1,x) + (n-2)*x*P(n-2,x) for n >= 3, with P(0,x) = 1, P(1,x) = 1 + x, P(2,x) = 3*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 1 + x;
P[2, x_] := 3*x;
P[n_, x_] := P[n, x] = Expand[Together[((n - 2)*P[n - 1, x] + (n - 2)*x*P[n - 2, x])/(n - 2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + x; v[3] = 3*x; for(n = 3, N, my(i = n + 1); v[i] = ((n - 2)*v[i - 1] + (n - 2)*x*v[i - 2])/(n - 2)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)

polytool c48629374597

Properties

Proof chains ? JSON

  • Liu–Wang theorem for three-term recurrences [LW07, Thm 2.1, Thm 2.3, Cor 2.4, Prop 3.3] polytool ? step › direct check

Used in 5

References

  1. [LW07] Lily L. Liu and Yi Wang. A unified approach to polynomial sequences with only real zeros. Advances in Applied Mathematics, 38(4):542–560, May 2007. doi:10.1016/j.aam.2006.02.003