Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081285
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081285 Table of coefficients of polynomials f_n(q) defined by 1/product_i>=1 (1-a q^i)^i = sum_n>=0 a^n q^n f_n(q) / ((q)_n)^2, where (x)_n is the q-Pochhammer symbol, defined to be product_i=0..n-1 (1-x q^i). +0
1
1, 1, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 1, 0, 1, 2, 4, 2, 4, 2, 4, 2, 1, 0, 1, 1, 0, 1, 2, 4, 6, 7, 8, 12, 12, 14, 12, 12, 8, 7, 6, 4, 2, 1, 0, 1, 1, 0, 1, 2, 4, 6, 12, 12, 21, 26, 37, 40, 55, 52, 61, 60, 61, 52, 55, 40, 37, 26, 21, 12, 12, 6, 4, 2, 1, 0, 1, 1, 0, 1, 2, 4, 6, 12, 18, 26, 38, 57, 76 (list; graph; listen)
OFFSET

0,9

COMMENT

f_n has degree n(n-1), so n-th row of table has n(n-1)+1 entries. Each row is palindromic. The sum of the terms in the n-th row is n!. The first n+1 terms of the n-th row are the same as the first n terms of A052847.

The 'major index' maj(p) of a permutation p = a_1 a_2 ... a_n is the sum of all i such that a_i > a_(i+1). f_n(q) = sum_p q^(maj(p)+maj(p^(-1))), where the sum is over all permutations of {1,2,...,n}.

REFERENCES

R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 1, 1999; Exercise 4.20.

LINKS

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

FORMULA

f_n(q) = sum_r=1..n (-1)^(r+1) q^(r(r-1)/2) (q)_(n-1) (q)_n / ((q)_(r) ((q)_(n-r))^2) f_(n-r)(q) for n>=1.

EXAMPLE

f_0 = f_1 = 1, f_2 = 1+q^2, f_3 = 1+q^2+2q^3+q^4+q^6, so sequence begins 1; 1; 1,0,1; 1,0,1,2,1,0,1; ...

MATHEMATICA

qpoch[x_, n_] := Product[1-x*q^i, {i, 0, n-1}]; f[0]=1; f[n_] := f[n]=Together[Sum[ -(-1)^r q^Binomial[r, 2] qpoch[q^(n-r+1), r-1]*qpoch[q^(r+1), n-r]/qpoch[q, n-r] f[n-r], {r, 1, n}]]; Join@@Table[CoefficientList[f[n], q], {n, 0, 7}]

CROSSREFS

Cf. A052847.

Adjacent sequences: A081282 A081283 A081284 this_sequence A081286 A081287 A081288

Sequence in context: A070107 A044933 A025915 this_sequence A069844 A124327 A082596

KEYWORD

nonn,tabf,easy

AUTHOR

Dean Hickerson (dean(AT)math.ucdavis.edu), using information supplied by Moshe Newman and R. P. Stanley, Mar 15 2003.

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 15 09:18 EDT 2008. Contains 145015 sequences.


AT&T Labs Research