A193917 -id:A193917 - cp's OEIS frontend

A193918 Mirror of the triangle A193917.

1, 1, 1, 3, 2, 1, 9, 6, 3, 2, 24, 15, 9, 5, 3, 64, 40, 24, 15, 8, 5, 168, 104, 64, 39, 24, 13, 8, 441, 273, 168, 104, 63, 39, 21, 13, 1155, 714, 441, 272, 168, 102, 63, 34, 21, 3025, 1870, 1155, 714, 440, 272, 165, 102, 55, 34, 7920, 4895, 3025, 1869, 1155

Offset: 0

Clark Kimberling, Aug 09 2011

A193918 is obtained by reversing the rows of the triangle A193917.
Here, we extend of the conjecture begun at A193917.  Suppose n is an even positive integer and r(n+1,x) is the polynomial matched to row n+1 of A193918 as in the Mathematica program, where the first row is counted as row 0.
Conjecture:  r(n+1,x) is the product of the following two polynomials whose coefficients are Fibonacci numbers:
  linear factor:  F(n+1)+x*F(n+2)
  other factor: F(n+2)+F(n)*x^2+F(n-2)*x^4+...+F(2)*x^n.
Example, for n=4:
  r(5,x)=64*x^5+40*x^4+24*x^3+15^x^2+8*x+5 factors as
  8x+5 times 8x^4+3x^2+1.

			First six rows:
1
1....1
3....2....1
9....6....3....2
24...15...9....5....3
64...40...24...15...8...5

Cf. A193917.

z = 12;
p[n_, x_] := Sum[Fibonacci[k + 1]*x^(n - k), {k, 0, n}];
q[n_, x_] := p[n, x];
t[n_, k_] := Coefficient[p[n, x], x^k]; t[n_, 0] := p[n, x] /. x -> 0;
w[n_, x_] := Sum[t[n, k]*q[n + 1 - k, x], {k, 0, n}]; w[-1, x_] := 1
g[n_] := CoefficientList[w[n, x], {x}]
TableForm[Table[Reverse[g[n]], {n, -1, z}]]
Flatten[Table[Reverse[g[n]], {n, -1, z}]]  (* A193917 *)
TableForm[Table[g[n], {n, -1, z}]]
Flatten[Table[g[n], {n, -1, z}]]  (* A193918 *)

Write w(n,k) for the triangle at A193917. The triangle at A193918 is then given by w(n,n-k).

A194000 Triangular array: the self-fission of (p(n,x)), where sum{F(k+1)*x^(n-k) : 0<=k<=n}, where F=A000045 (Fibonacci numbers).

Original entry on oeis.org

1, 2, 3, 3, 5, 9, 5, 8, 15, 24, 8, 13, 24, 39, 64, 13, 21, 39, 63, 104, 168, 21, 34, 63, 102, 168, 272, 441, 34, 55, 102, 165, 272, 440, 714, 1155, 55, 89, 165, 267, 440, 712, 1155, 1869, 3025, 89, 144, 267, 432, 712, 1152, 1869, 3024, 4895, 7920, 144, 233

Offset: 0

Clark Kimberling, Aug 11 2011

See A193917 for the self-fusion of the same sequence of polynomials.  (Fusion is defined at A193822; fission, at A193842; see A202503 and A202453 for infinite-matrix representations of fusion and fission.)
...
First five rows of P (triangle of coefficients of polynomials p(n,x)):
1
1...1
1...1...2
1...1...2...3
1...1...2...3...5
First eight rows of A194000:
1
2....3
3....5....9
5....8....15...24
8....13...24...39...64
13...21...29...63...104...168
21...34...63...102..168...272...441
34...55...102..165..272...440...714..1155
...
col 1:  A000045
col 2:  A000045
col 3:  A022086
col 4:  A022086
col 5:  A022091
col 6:  A022091
right edge, d(n,n):  A064831
d(n,n-1):  A059840
d(n,n-2):  A080097
d(n,n-3):  A080143
d(n,n-4):  A080144
...
Suppose n is an odd positive integer and d(n+1,x) is the polynomial matched to row n+1 of A194000 as in the Mathematica program (and definition of fission at A193842), where the first row is counted as row 0.

			First six rows:
1
2....3
3....5....9
5....8....15...24
8....13...24...39...64
13...21...29...63...104...168
...
Referring to the matrix product for fission at A193842,
the row (5,8,15,24) is the product of P(4) and QQ, where
P(4)=(p(4,4), p(4,3), p(4,2), p(4,1))=(5,3,2,1); and
QQ is the 4x4 matrix
(1..1..2..3)
(0..1..1..2)
(0..0..1..1)
(0..0..0..1).

Cf. A193842, A194001, A193917, A193918.

z = 11;
p[n_, x_] := Sum[Fibonacci[k + 1]*x^(n - k), {k, 0, n}];
q[n_, x_] := p[n, x];
p1[n_, k_] := Coefficient[p[n, x], x^k];
p1[n_, 0] := p[n, x] /. x -> 0;
d[n_, x_] := Sum[p1[n, k]*q[n - 1 - k, x], {k, 0, n - 1}]
h[n_] := CoefficientList[d[n, x], {x}]
TableForm[Table[Reverse[h[n]], {n, 0, z}]]
Flatten[Table[Reverse[h[n]], {n, -1, z}]]  (* A194000 *)
TableForm[Table[h[n], {n, 0, z}]]
Flatten[Table[h[n], {n, -1, z}]]  (* A194001 *)

cp's OEIS Frontend

A193918 Mirror of the triangle A193917.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula