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 ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 1 | 1 | 2 | ||||||
| 2 | 0 | 3 | 3 | ||||||
| 3 | 0 | 4 | 1 | 5 | |||||
| 4 | 0 | 4 | 4 | 8 | |||||
| 5 | 0 | 4 | 8 | 1 | 13 | ||||
| 6 | 0 | 4 | 12 | 5 | 21 | ||||
| 7 | 0 | 4 | 16 | 13 | 1 | 34 | |||
| 8 | 0 | 4 | 20 | 25 | 6 | 55 | |||
| 9 | 0 | 4 | 24 | 41 | 19 | 1 | 89 | ||
| 10 | 0 | 4 | 28 | 61 | 44 | 7 | 144 | ||
| 11 | 0 | 4 | 32 | 85 | 85 | 26 | 1 | 233 | |
| 12 | 0 | 4 | 36 | 113 | 146 | 70 | 8 | 377 | |
| 13 | 0 | 4 | 40 | 145 | 231 | 155 | 34 | 1 | 610 |
| 14 | 0 | 4 | 44 | 181 | 344 | 301 | 104 | 9 | 987 |
b-files: A129718 ?
Compute more
?
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 ?
Row sums ? A202278, A248740, A274163, A185357, A077373, A000045, A212804, A132636
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle 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 FormulaThe 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 MathematicaP[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/GPP(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 ExampleTriangle 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 FormulaThe 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 MathematicaP[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/GPP(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
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Liu–Wang theorem for three-term recurrences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Liu–Wang theorem for three-term recurrences
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m ≥ 2
Proof chains ? JSON
Used in 5
- basis_map_A008277 of Triangle read by rows: T(n,k) is the number of Fibonacci b… Image under a basis map u^k -> P_k (A008277)
- basis_map_A013611 of Triangle read by rows: T(n,k) is the number of Fibonacci b… Image under a basis map u^k -> P_k (A013611)
- basis_map_A013610 of Triangle read by rows: T(n,k) is the number of Fibonacci b… Image under a basis map u^k -> P_k (A013610)
- basis_map_A013609 of Triangle read by rows: T(n,k) is the number of Fibonacci b… Image under a basis map u^k -> P_k (A013609)
- basis_map_A007318 of Triangle read by rows: T(n,k) is the number of Fibonacci b… Image under a basis map u^k -> P_k (A007318)
References
- [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