|
%I #35 Jul 21 2022 10:41:10
%S 1,1,1,1,1,1,1,2,1,1,2,2,1,3,4,1,1,3,6,2,1,4,9,6,1,1,4,12,10,3,1,5,16,
%T 19,9,1,1,5,20,28,19,3,1,6,25,44,38,12,1,1,6,30,60,66,28,4,1,7,36,85,
%U 110,66,16,1,1,7,42,110,170,126,44,4,1,8,49,146,255,236,110,20,1,1,8,56
%N Triangle read by rows, formed from antidiagonals of Losanitsch's triangle. T(n,k ) = A034851(n-k, k), n >= 0 and 0 <= k <= floor(n/2).
%C Row sums A102526 are essentially the same as A001224, A060312 and A068928.
%C Moving the terms in each column of this triangle, see the example, upwards to row 0 gives Losanitsch’s triangle A034851 as a square array. - _Johannes W. Meijer_, Aug 24 2013
%C The number of ways to cover n-length line by exactly k 2-length segments excluding symmetric covers. - _Philipp O. Tsvetkov_, Nov 08 2013
%C Also the number of equivalence classes of ways of placing k 2 X 2 tiles in an n X 2 rectangle under all symmetry operations of the rectangle. - _Christopher Hunt Gribble_, Feb 16 2014
%C T(n, k) is the number of irreducible caterpillars with n+3 edges and diameter k+2. - _Christian Barrientos_, Apr 05 2020
%F T(n, k) = A034851(n-k, k), n >= 0 and 0 <= k <= floor(n/2).
%F T(n, k) = T(n-1, k) + T(n-2, k-1) - C((n-3)/2-(k-1)/2, (n-3)/2-(k-1)) except when n or k even then T(n, k) = T(n-1, k) + T(n-2, k-1) with T(0, 0) = 1, T(n, 0) = 0 for n<0 and T(n, k) = 0 for k < 0 and k > floor(n/2). - _Johannes W. Meijer_, Aug 24 2013
%e The first few rows of triangle T(n, k) are:
%e n/k: 0, 1, 2, 3
%e 0: 1
%e 1: 1
%e 2: 1, 1
%e 3: 1, 1
%e 4: 1, 2, 1
%e 5: 1, 2, 2
%e 6: 1, 3, 4, 1
%e 7: 1, 3, 6, 2
%p From _Johannes W. Meijer_, Aug 24 2013: (Start)
%p T := proc(n,k) option remember: if n <0 then return(0) fi: if k < 0 or k > floor(n/2) then return(0) fi: A034851(n-k, k) end: A034851 := proc(n, k) option remember; local t; if k = 0 or k = n then return(1) fi; if n mod 2 = 0 and k mod 2 = 1 then t := binomial(n/2-1, (k-1)/2) else t := 0; fi; A034851(n-1, k-1) + A034851(n-1, k)-t; end: seq(seq(T(n, k), k=0..floor(n/2)), n=0..16); # End first program
%p T := proc(n,k) option remember: if n < 0 then return(0) fi: if k < 0 or k > floor(n/2) then return(0) fi: if n=0 then return(1) fi: if type(n, even) or type(k, even) then procname(n-1, k) + procname(n-2, k-1) else procname(n-1, k) + procname(n-2, k-1) - binomial((n-3)/2-(k-1)/2, (n-3)/2-(k-1)) fi: end: seq(seq(T(n, k), k=0..floor(n/2)), n=0..16); # End second program (End)
%t t[n_?EvenQ, k_?OddQ] := Binomial[n, k]/2;
%t t[n_, k_] := (Binomial[n, k] + Binomial[Quotient[n, 2], Quotient[k, 2]])/2;
%t T[n_, k_] := t[n - k, k];
%t Table[T[n, k], {n, 0, 16}, {k, 0, Quotient[n, 2]}] // Flatten (* _Jean-François Alcover_, Jul 21 2022 *)
%Y Cf. A034851, A005685, A005688, A068930, A102526, A102543, A192928.
%K nonn,tabf
%O 0,8
%A _Gerald McGarvey_, Feb 24 2005
%E Definition edited, incorrect formula deleted, keyword corrected and extended by _Johannes W. Meijer_, Aug 24 2013
|
