|
| |
|
|
A122580
|
|
Number of partitions of n with crank congruent to 0 mod 3, minus number of partitions of n with crank congruent to 1 mod 3.
|
|
0
| |
|
|
1, -2, -1, 3, -1, 1, 2, -3, -2, 3, -3, -1, 5, -4, 0, 5, -3, 0, 7, -8, -3, 9, -6, -2, 9, -10, -3, 13, -11, -1, 15, -13, -3, 18, -14, -3, 22, -20, -7, 27, -21, -3, 29, -27, -8, 34, -30, -7, 42, -37, -8, 48, -39, -9, 55, -50, -13, 66, -52, -11, 74
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| For a partition p, let l(p) = largest part of p, w(p) = number of 1's in p, m(p) = number of parts of p larger than w(p). The crank of p is given by l(p) if w(p) = 0, otherwise m(p)-w(p).
|
|
|
LINKS
| Daniel M. Kane, RESOLUTION OF A CONJECTURE OF ANDREWS AND LEWIS INVOLVING CRANKS OF PARTITIONS
|
|
|
FORMULA
| G.f.: Product((1-x^n)/(1+x^n+x^(2*n)),n=1..infinity). Euler transform of period 3 sequence [ -2,-2,-1, ...].
|
|
|
CROSSREFS
| Sequence in context: A140583 A123507 A188804 * A107041 A070099 A126760
Adjacent sequences: A122577 A122578 A122579 * A122581 A122582 A122583
|
|
|
KEYWORD
| easy,sign
|
|
|
AUTHOR
| Vladeta Jovovic (vladeta(AT)eunet.rs), Oct 20 2006
|
| |
|
|
