login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A101164 Triangle read by rows: Delannoy numbers minus binomial coefficients. 8

%I #35 Nov 07 2023 04:43:40

%S 0,0,0,0,1,0,0,2,2,0,0,3,7,3,0,0,4,15,15,4,0,0,5,26,43,26,5,0,0,6,40,

%T 94,94,40,6,0,0,7,57,175,251,175,57,7,0,0,8,77,293,555,555,293,77,8,0,

%U 0,9,100,455,1079,1431,1079,455,100,9,0,0,10,126,668,1911,3191,3191,1911,668,126,10,0

%N Triangle read by rows: Delannoy numbers minus binomial coefficients.

%H Reinhard Zumkeller, <a href="/A101164/b101164.txt">Rows n = 0..100 of table, flattened</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/DelannoyNumber.html">Delannoy Number</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/BinomialCoefficient.html">Binomial Coefficient</a>

%H <a href="/index/Pas#Pascal">Index entries for triangles and arrays related to Pascal's triangle</a>

%F T(n, k) = A008288(n, k) - binomial(n, k), 0<=k<=n, where binomial=A007318.

%F T(n,2) = A005449(n-2) for n>1;

%F T(n,3) = A101165(n-3) for n>2;

%F T(n,4) = A101166(n-4) for n>3;

%F Sum_{k=0..n} T(n, k) = A094706(n).

%F From _G. C. Greubel_, Sep 17 2021: (Start)

%F T(n, k) = Sum_{j=0..n-k} binomial(n-k, j)*binomial(k, j)*2^j - binomial(n,k).

%F T(n, 1) = n-1, n > 0. (End)

%e Triangle begins as:

%e 0

%e 0, 0;

%e 0, 1, 0;

%e 0, 2, 2, 0;

%e 0, 3, 7, 3, 0;

%e 0, 4, 15, 15, 4, 0;

%e 0, 5, 26, 43, 26, 5, 0;

%e 0, 6, 40, 94, 94, 40, 6, 0;

%e 0, 7, 57, 175, 251, 175, 57, 7, 0;

%t T[n_, k_]:= Hypergeometric2F1[-k, k-n, 1, 2] - Binomial[n, k];

%t Table[T[n, k], {n,0,12}, {k,0,n}]//Flatten (* _G. C. Greubel_, Sep 17 2021 *)

%o (Haskell)

%o a101164 n k = a101164_tabl !! n !! k

%o a101164_row n = a101164_tabl !! n

%o a101164_tabl = zipWith (zipWith (-)) a008288_tabl a007318_tabl

%o -- _Reinhard Zumkeller_, Jul 30 2013

%o (Magma)

%o A101164:= func< n,k | (&+[Binomial(n-k,j)*Binomial(k,j)*2^j: j in [0..n-k]]) - Binomial(n,k) >;

%o [A101164(n,k): k in [0..n], n in [0..12]]; // _G. C. Greubel_, Sep 17 2021

%o (Sage)

%o def T(n,k): return simplify(hypergeometric([-n+k, -k], [1], 2)) - binomial(n,k)

%o flatten([[T(n,k) for k in (0..n)] for n in (0..12)]) # _G. C. Greubel_, Sep 17 2021

%Y Cf. A001477, A005449, A008288, A094706, A101165, A101166, A225413.

%K nonn,tabl

%O 0,8

%A _Reinhard Zumkeller_, Dec 03 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 11:39 EDT 2024. Contains 371969 sequences. (Running on oeis4.)