|
%I #41 Sep 08 2022 08:45:16
%S 1,1,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,
%T 0,1,1,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,1,1,0,
%U 0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,1
%N Triangular array T read by rows: T(n, 0) = T(n, n) = 1, T(n, k) = 0 for 0 <= k <= n.
%C Equals Pascal's triangle (A007318) where all elements > 1 are replaced with zero. Therefore it might be called "binomial skeleton".
%C Row sums are in A040000, antidiagonal sums are in A040001. When construed as a lower triangular matrix, the matrix inverse is A103452.
%H Michael De Vlieger, <a href="/A103451/b103451.txt">Rows n = 0..140 of triangle, flattened</a>
%H Carl M. Bender and Gerald V. Dunne, <a href="http://dx.doi.org/10.1063/1.527869">Polynomials and operator orderings</a>, J. Math. Phys. 29 (1988), 1727-1731.
%F a(n) = A097806(n-1) for n > 0. - _Philippe Deléham_, Oct 16 2007
%F T(n,k) = C(n,k-n) + C(n,-k) - C(0,n+k), 0 <= k <= n. - _Eric Werley_, Jul 01 2011
%e First few rows are:
%e 1;
%e 1, 1;
%e 1, 0, 1;
%e 1, 0, 0, 1;
%e 1, 0, 0, 0, 1;
%e 1, 0, 0, 0, 0, 1;
%e ...
%t Table[Boole[n == 0 || Mod[k, n] == 0], {n, 0, 14}, {k, 0, n}] (* or *)
%t Table[Binomial[n, k - n] + Binomial[n, -k] - Binomial[0, n + k], {n, 0, 14}, {k, 0, n}] // Flatten (* _Michael De Vlieger_, Jul 19 2016 *)
%o (Magma) r:=14; T:=ScalarMatrix(r, 1); for n in [1..r] do T[n, 1]:=1; end for; &cat[ [ T[n, k]: k in [1..n] ]: n in [1..r] ];
%o (Magma) /* As triangle */ [[Binomial(n, k-n)+Binomial(n, -k)-Binomial(0, n+k): k in [0..n]]: n in [0.. 15]]; // _Vincenzo Librandi_, Jul 20 2016
%o (PARI) for(n=0,15, for(k=0,n, print1(if(k==0||k==n, 1, 0), ", "))) \\ _G. C. Greubel_, Dec 08 2018
%o (Sage)
%o def A103451(n,k): return 1 if (k==0 or k==n) else 0
%o flatten([[A103451(n,k) for k in (0..n)] for n in (0..15)]) # _G. C. Greubel_, Feb 14 2021
%Y Cf. A007318, A040000, A040001, A097806, A103452.
%K easy,nonn,tabl
%O 0,1
%A _Paul Barry_, Feb 06 2005
%E Edited by _Klaus Brockhaus_, Jan 26 2011
|
