A128100 -id:A128100 - cp's OEIS frontend

A111006 Another version of Fibonacci-Pascal triangle A037027.

1, 0, 1, 0, 1, 2, 0, 0, 2, 3, 0, 0, 1, 5, 5, 0, 0, 0, 3, 10, 8, 0, 0, 0, 1, 9, 20, 13, 0, 0, 0, 0, 4, 22, 38, 21, 0, 0, 0, 0, 1, 14, 51, 71, 34, 0, 0, 0, 0, 0, 5, 40, 111, 130, 55, 0, 0, 0, 0, 0, 1, 20, 105, 233, 235, 89, 0, 0, 0, 0, 0, 0, 6, 65, 256, 474, 420, 144

Offset: 0

Philippe Deléham, Oct 02 2005

Triangle T(n,k), 0 <= k <= n, read by rows, given by [0, 1, -1, 0, 0, 0, 0, 0, 0, 0, ...] DELTA [1, 1, -1, 0, 0, 0, 0, 0, 0, ...] where DELTA is the operator defined in A084938.
Row sums are the Jacobsthal numbers A001045(n+1) and column sums form Pell numbers A000129.
Maximal column entries: A038149 = {1, 1, 2, 5, 10, 22, ...}.
T(n,k) gives a convolved Fibonacci sequence (A001629, A001872, ...).
Triangle read by rows: T(n,n-k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pieces of 1 X 2 tiles (0 <= k <= floor(n/2)). - Philippe Deléham, Feb 17 2014
Diagonal sums are A013979(n). - Philippe Deléham, Feb 17 2014
T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and 1 X 2 tiles. - Emeric Deutsch, Aug 14 2014

			Triangle begins:
  1;
  0, 1;
  0, 1, 2;
  0, 0, 2, 3;
  0, 0, 1, 5,  5;
  0, 0, 0, 3, 10,  8;
  0, 0, 0, 1,  9, 20, 13;
  0, 0, 0, 0,  4, 22, 38,  21;
  0, 0, 0, 0,  1, 14, 51,  71,  34;
  0, 0, 0, 0,  0,  5, 40, 111, 130,  55;
  0, 0, 0, 0,  0,  1, 20, 105, 233, 235,  89;
  0, 0, 0, 0,  0,  0,  6,  65, 256, 474, 420, 144;

Reinhard Zumkeller, Rows n = 0..120 of table, flattened
Index entries for triangles and arrays related to Pascal's triangle

Cf. A000045, A000129, A001045, A037027, A038112, A038149, A084938, A128100 (reversed version).

Some other Fibonacci-Pascal triangles: A027926, A036355, A037027, A074829, A105809, A109906, A114197, A162741, A228074.

a111006 n k = a111006_tabl !! n !! k
a111006_row n = a111006_tabl !! n
a111006_tabl =  map fst $ iterate (\(us, vs) ->
   (vs, zipWith (+) (zipWith (+) ([0] ++ us ++ [0]) ([0,0] ++ us))
                    ([0] ++ vs))) ([1], [0,1])
-- Reinhard Zumkeller, Aug 15 2013

T(0, 0) = 1, T(n, k) = 0 for k < 0 or for n < k, T(n, k) = T(n-1, k-1) + T(n-2, k-1) + T(n-2, k-2).
T(n, k) = A037027(k, n-k). T(n, n) = A000045(n+1). T(3n, 2n) = (n+1)*A001002(n+1) = A038112(n).
G.f.: 1/(1-yx(1-x)-x^2*y^2). - Paul Barry, Oct 04 2005
Sum_{k=0..n} x^k*T(n,k) = (-1)^n*A053524(n+1), (-1)^n*A083858(n+1), (-1)^n*A002605(n), A033999(n), A000007(n), A001045(n+1), A083099(n) for x = -4, -3, -2, -1, 0, 1, 2 respectively. - Philippe Deléham, Dec 02 2006
Sum_{k=0..n} T(n,k)*x^(n-k) = A053404(n), A015447(n), A015446(n), A015445(n), A015443(n), A015442(n), A015441(n), A015440(n), A006131(n), A006130(n), A001045(n+1), A000045(n+1) for x = 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 respectively. - Philippe Deléham, Feb 17 2014

A249303 Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.

Original entry on oeis.org

1, 0, 1, -1, 2, -1, 1, 1, 0, -2, 3, 1, -4, 3, 1, 1, -2, -2, 4, 0, 3, -9, 6, 1, -1, 6, -9, 0, 5, -1, 3, 3, -15, 10, 1, 0, -4, 18, -24, 5, 6, 1, -8, 18, -6, -20, 15, 1, 1, -4, -4, 36, -49, 14, 7, 0, 5, -30, 60, -35, -21, 21, 1, -1, 10, -30, 20, 50, -84, 28, 8

Offset: 0

Clark Kimberling, Oct 24 2014

The polynomial p(n,x) is the numerator of the rational function given by f(n,x) = 1 + (x - 1)/f(n-1,x), where f(0,x) = 1.
Every row sum is 1.  The first column is purely periodic with period (1,0,-1,-1,0,1).
Conjecture:  for n > 2, p(n,x) is irreducible if and only if n is a (prime - 2).  More generally, if c is arbitrary and f(n,x) = 1 + (x + c)/f(n-1,x), where f(x,0) = 1, then p(n,x) is irreducible if and only if n is a (prime - 2).

			f(0,x) = 1/1, so that p(0,x) = 1
f(1,x) = x/1, so that p(1,x) = x;
f(2,x) = (-1 + 2 x)/x, so that p(2,x) = -1 + 2 x.
First 6 rows of the triangle of coefficients:
... 1
... 0 ... 1
.. -1 ... 2
.. -1 ... 1 ... 1
... 0 .. -2 ... 3
... 1 .. -4 ... 3 ... 1

Clark Kimberling, Rows 0..100, flattened

Cf. A128100, A229057, A229074.

z = 20; f[n_, x_] := 1 + (x - 1)/f[n - 1, x]; f[0, x_] = 1;
t = Table[Factor[f[n, x]], {n, 0, z}]
u = Numerator[t]
TableForm[Rest[Table[CoefficientList[u[[n]], x], {n, 0, z}]]] (* A249303 array *)
v = Flatten[CoefficientList[u, x]] (* A249303 *)

cp's OEIS Frontend

A111006 Another version of Fibonacci-Pascal triangle A037027.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Formula