A112465 Riordan array (1/(1+x), x/(1-x)).

1, -1, 1, 1, 0, 1, -1, 1, 1, 1, 1, 0, 2, 2, 1, -1, 1, 2, 4, 3, 1, 1, 0, 3, 6, 7, 4, 1, -1, 1, 3, 9, 13, 11, 5, 1, 1, 0, 4, 12, 22, 24, 16, 6, 1, -1, 1, 4, 16, 34, 46, 40, 22, 7, 1, 1, 0, 5, 20, 50, 80, 86, 62, 29, 8, 1, -1, 1, 5, 25, 70, 130, 166, 148, 91, 37, 9, 1, 1, 0, 6, 30, 95, 200, 296, 314, 239, 128, 46, 10, 1

Offset

0,13

Comments

Inverse is A112466. Note that C(n,k) = Sum_{j = 0..n-k} C(j+k-1, j).

Links

Reinhard Zumkeller, Rows n = 0..125 of triangle, flattened

Roland Bacher, Chebyshev polynomials, quadratic surds and a variation of Pascal's triangle, arXiv:1509.09054 [math.CO], 2015.

E. Deutsch, L. Ferrari and S. Rinaldi, Production Matrices, Advances in Mathematics, 34 (2005) pp. 101-122.

Index entries for triangles and arrays related to Pascal's triangle

Formula

Number triangle T(n, k) = Sum_{j=0..n-k} (-1)^(n-k-j)*C(j+k-1, j).

T(2*n, n) = A072547(n) (main diagonal). - Paul Barry, Apr 08 2011

From Reinhard Zumkeller, Jan 03 2014: (Start)

T(n, k) = T(n-1, k-1) + T(n-1, k), 0 < k < n, with T(n, 0) = (-1)^n and T(n, n) = 1.

T(n, k) = A108561(n, n-k). (End)

T(n, k) = T(n-1, k-1) + T(n-2, k) + T(n-2, k-1), T(0, 0) = 1, T(1, 0) = -1, T(1, 1) = 1, T(n, k) = 0 if k < 0 or if k > n. - Philippe Deléham, Jan 11 2014

exp(x) * e.g.f. for row n = e.g.f. for diagonal n. For example, for n = 3 we have exp(x)*(-1 + x + x^2/2! + x^3/3!) = -1 + 2*x^2/2! + 6*x^3/3! + 13*x^4/4! + .... The same property holds more generally for Riordan arrays of the form ( f(x), x/(1 - x) ). - Peter Bala, Dec 21 2014

Example

Triangle starts
   1;
  -1, 1;
   1, 0, 1;
  -1, 1, 1,  1;
   1, 0, 2,  2,  1;
  -1, 1, 2,  4,  3,  1;
   1, 0, 3,  6,  7,  4,  1;
  -1, 1, 3,  9, 13, 11,  5, 1;
   1, 0, 4, 12, 22, 24, 16, 6, 1;
Production matrix begins
  -1, 1;
   0, 1, 1;
   0, 0, 1, 1;
   0, 0, 0, 1, 1;
   0, 0, 0, 0, 1, 1;
   0, 0, 0, 0, 0, 1, 1;
   0, 0, 0, 0, 0, 0, 1, 1;
   0, 0, 0, 0, 0, 0, 0, 1, 1; - Paul Barry, Apr 08 2011

Mathematica

T[n_, k_]:= Sum[Binomial[j+k-1, j]*(-1)^(n-k-j), {j, 0, n-k}];
Table[T[n, k], {n, 0, 12}, {k, 0, n}]//Flatten (* Jean-François Alcover, Jul 23 2018 *)

Prog

(Haskell)
a112465 n k = a112465_tabl !! n !! k
a112465_row n = a112465_tabl !! n
a112465_tabl = iterate f [1] where
   f xs'@(x:xs) = zipWith (+) ([-x] ++ xs ++ [0]) ([0] ++ xs')
-- Reinhard Zumkeller, Jan 03 2014
(Magma)
A112465:= func< n, k | (-1)^(n+k)*(&+[(-1)^j*Binomial(j+k-1, j): j in [0..n-k]]) >;
[A112465(n, k): k in [0..n], n in [0..13]]; // G. C. Greubel, Apr 18 2025
(SageMath)
def A112465(n, k): return (-1)^(n+k)*sum((-1)^j*binomial(j+k-1, j) for j in range(n-k+1))
print(flatten([[A112465(n, k) for k in range(n+1)] for n in range(13)])) # G. C. Greubel, Apr 18 2025

Crossrefs

Cf. A059260, A108561, A112466, A112468.

Columns: A033999(n) (k=0), A000035(n) (k=1), A004526(n) (k=2), A002620(n-1) (k=3), A002623(n-4) (k=4), A001752(n-5) (k=5), A001753(n-6) (k=6), A001769(n-7) (k=7), A001779(n-8) (k=8), A001780(n-9) (k=9), A001781(n-10) (k=10), A001786(n-11) (k=11), A001808(n-12) (k=12).

Diagonals: A000012(n) (k=n), A023443(n) (k=n-1), A152947(n-1) (k=n-2), A283551(n-3) (k=n-3).

Main diagonal: A072547.

Sums: A078008 (row), A078024 (diagonal), A092220 (signed diagonal), A280560 (signed row).

Sequence in context: A031282 A085685 A267632 * A112468 A207194 A349670

Adjacent sequences: A112462 A112463 A112464 * A112466 A112467 A112468

Keyword

easy,sign,tabl

Author

Paul Barry, Sep 06 2005

Status

approved