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!)
A300437 Triangle T(nu,m) read by rows: The number of N-color odd self-inverse compositions of (2*nu+1) into (2*m+1) parts. 3

%I #10 Aug 15 2023 10:53:02

%S 1,3,1,5,3,1,7,8,3,1,9,16,11,3,1,11,29,25,14,3,1,13,47,58,34,17,3,1,

%T 15,72,110,96,43,20,3,1,17,104,206,200,143,52,23,3,1,19,145,346,442,

%U 317,199,61,26,3,1,21,195,571,822,807,461,264,70,29,3,1,23,256,881,1565,1613,1328,632,338,79,32,3,1

%N Triangle T(nu,m) read by rows: The number of N-color odd self-inverse compositions of (2*nu+1) into (2*m+1) parts.

%C Table 1 of Guo contains several typos which are not compliant with the formula on page 4 for S_o(2k+1,2l+1). Also the formula has been modified to read S_o(2k+1,2l+1) = sum_{t=1..2k+1) sum_{i+j= (2k+1-t-2l)/4} t*binomial(2l+i-1,2l-1)*binomial(l,j). So the upper limit on t has been extended and a factor t has been inserted.

%H Y.-h. Guo, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL17/Guo/guo9.html">n-Color Odd Self-Inverse Compositions</a>, J. Int. Seq. 17 (2014) # 14.10.5, Table 1.

%F 64*T(nu+2,2) = 51 +1306/15*nu +13*(-1)^nu +56/3*nu^3 +170/3*nu^2 +4/15*nu^5 +10*(-1)^nu*nu +2*(-1)^nu*nu^2 +10/3*nu^4 with g.f. (1+x^2)^2/[(1+x)^3*(1-x)^6], column 2.

%e The triangle starts in row nu=0 with columns 0<=m<=nu as:

%e 1;

%e 3,1;

%e 5,3,1;

%e 7,8,3,1;

%e 9,16,11,3,1;

%e 11,29,25,14,3,1;

%e 13,47,58,34,17,3,1;

%e 15,72,110,96,43,20,3,1;

%e 17,104,206,200,143,52,23,3,1;

%e 19,145,346,442,317,199,61,26,3,1;

%e 21,195,571,822,807,461,264,70,29,3,1;

%e 23,256,881,1565,1613,1328,632,338,79,32,3,1;

%e 25,328,1337,2671,3478,2800,2032,830,421,88,35,3,1;

%e 27,413,1939,4596,6402,6742,4464,2946,1055,513,97,38,3,1;

%p A300437 := proc(k,l)

%p local a,t,i,j ;

%p a := 0 ;

%p for t from 1 to 2*k+1 by 2 do

%p for j from 0 to l do

%p i := (2*k+1-t-2*l)/4-j ;

%p if type(i,'integer') then

%p a := a+t*binomial(2*l+i-1,2*l-1)*binomial(l,j) ;

%p end if;

%p end do:

%p end do:

%p a ;

%p end proc:

%p seq(seq(A300437(k,l),l=0..k),k=0..13) ;

%t A300437[k_, l_] := Module[{a, t, i, j }, a = 0; For[t = 1, t <= 2k + 1, t += 2, For[j = 0, j <= l, j++, i = (2k + 1 - t - 2*l)/4 - j; If[ IntegerQ[i], a = a + t*Binomial[2l + i - 1, 2l - 1]*Binomial[l, j]]]]; a];

%t Table[Table[A300437[k, l], {l, 0, k}], {k, 0, 13}] // Flatten (* _Jean-François Alcover_, Aug 15 2023, after Maple code *)

%Y Cf. A131941 (column 2?), A300438 (row sums), A292835.

%K nonn,tabl,easy

%O 0,2

%A _R. J. Mathar_, Mar 05 2018

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 23 08:11 EDT 2024. Contains 371905 sequences. (Running on oeis4.)