%I #20 Mar 16 2018 17:03:01
%S 1,0,0,1,0,1,0,0,0,0,1,0,2,0,1,0,0,0,0,0,0,1,0,3,0,3,0,1,0,0,0,0,0,0,
%T 0,0,1,0,4,0,6,0,4,0,1,0,0,0,0,0,0,0,0,0,0,1,0,5,0,10,0,10,0,5,0,1,0,
%U 0,0,0,0,0,0,0,0,0,0,0,1,0,6,0,15,0,20
%N Pascal's triangle interspersed with rows of zeros, and the rows of Pascal's triangle are interspersed with zeros.
%C Auxiliary array for computing Losanitsch's triangle A034851;
%C T(n, k) + T(n, k + 2) = T(n + 2, k + 2) for k < n - 1.
%H Reinhard Zumkeller, <a href="/A204293/b204293.txt">Rows n=0..100 of triangle, flattened</a>
%H S. M. Losanitsch, <a href="/A000602/a000602_1.pdf">Die Isomerie-Arten bei den Homologen der Paraffin-Reihe</a>, Chem. Ber. 30 (1897), 1917-1926. (Annotated scanned copy)
%H N. J. A. Sloane, <a href="/classic.html#LOSS">Classic Sequences: Losanitsch's Triangle</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/LosanitschsTriangle.html">Losanitsch's Triangle</a>
%H <a href="/index/Pas#Pascal">Index entries for triangles and arrays related to Pascal's triangle</a>
%F T(n, k) = (1 - n mod 2) * (1 - k mod 2) * binomial(floor(n/2),floor(k/2)).
%t t[n_?EvenQ, k_?EvenQ] := Binomial[n/2, k/2]; t[_, _] = 0; Flatten[Table[t[n, k], {n, 0, 12}, {k, 0, n}]] (* _Jean-François Alcover_, Feb 07 2012 *)
%o (Haskell)
%o a204293 n k = a204293_tabl !! n !! k
%o a204293_row n = a204293_tabl !! n
%o a204293_tabl = [1] : [0,0] : f [1] [0,0] where
%o f xs ys = xs' : f ys xs' where
%o xs' = zipWith (+) ([0,0] ++ xs) (xs ++ [0,0])
%Y Cf. A077957 (row sums), A126869 (central terms); A108044, A007318.
%K nonn,tabl
%O 0,13
%A _Reinhard Zumkeller_, Jan 14 2012
%E Formula for T(n,k) corrected by _Peter Bala_, Jul 06 2015