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!)
A123221 Irregular triangle read by rows: the n-th row consists of the coefficients in the expansion of Sum_{j=0..n*(n+1)/2} A008302(n+1,j)*x^j*(1 - x)^(n - min(n, j)), where A008302 is the triangle of Mahonian numbers. 13

%I #15 Jul 16 2021 02:37:23

%S 1,1,1,0,1,1,1,0,2,3,5,3,1,1,0,3,5,11,22,20,15,9,4,1,1,0,4,7,18,41,90,

%T 101,101,90,71,49,29,14,5,1,1,0,5,9,26,64,154,359,455,531,573,573,531,

%U 455,359,259,169,98,49,20,6,1,1,0,6,11,35,91,234,583

%N Irregular triangle read by rows: the n-th row consists of the coefficients in the expansion of Sum_{j=0..n*(n+1)/2} A008302(n+1,j)*x^j*(1 - x)^(n - min(n, j)), where A008302 is the triangle of Mahonian numbers.

%H G. C. Greubel, <a href="/A123221/b123221.txt">Rows n = 0..20 of the irregular triangle, flattened</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Major_index">Major index</a>

%F T(n,k) = A008302(n+1,k) for n + 1 <= k <= n*(n + 1)/2, n > 1. - _Franck Maminirina Ramaharo_, Oct 14 2018

%e Triangle begins:

%e 1;

%e 1;

%e 1, 0, 1, 1;

%e 1, 0, 2, 3, 5, 3, 1;

%e 1, 0, 3, 5, 11, 22, 20, 15, 9, 4, 1;

%e 1, 0, 4, 7, 18, 41, 90, 101, 101, 90, 71, 49, 29, 14, 5, 1;

%e ...

%t M[n_]:= CoefficientList[Product[1-x^j, {j, n}]/(1-x)^n, x];

%t Table[CoefficientList[Sum[M[n+1][[m+1]]*x^m*(1-x)^(n -Min[n, m]), {m, 0, Binomial[n+1,2]}], x], {n, 0, 10}]//Flatten

%o (Maxima)

%o A008302(n, k) := ratcoef(ratsimp(product((1 - x^j)/(1 - x), j, 1, n)), x, k)$

%o P(x, n) := sum(A008302(n + 1, j)*x^j*(1 - x)^(n - min(n, j)), j, 0, n*(n + 1)/2)$

%o create_list(ratcoef(expand(P(x, n)), x, k), n, 0, 10, k, 0, hipow(P(x, n), x)); /* _Franck Maminirina Ramaharo_, Oct 14 2018 */

%o (Sage)

%o @CachedFunction

%o def A008302(n,k):

%o if (k<0 or k>binomial(n,2)): return 0

%o elif (n==1 and k==0): return 1

%o else: return A008302(n, k-1) + A008302(n-1, k) - A008302(n-1, k-n)

%o def p(n,x): return sum( A008302(n+1, j)*x^j*(1-x)^(n-min(n, j)) for j in (0..binomial(n+1,2)) )

%o def T(n): return ( p(n,x) ).full_simplify().coefficients(sparse=False)

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

%Y Cf. A122753, A123018, A123019, A123021, A123027, A123199, A123202, A123217.

%K nonn,tabf

%O 0,9

%A _Roger L. Bagula_, Oct 05 2006

%E Edited, new name, and offset corrected by _Franck Maminirina Ramaharo_, Oct 14 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 May 10 17:06 EDT 2024. Contains 372388 sequences. (Running on oeis4.)