OFFSET
1,4
COMMENTS
Conjecture: Equals the number of partitions of n with at least one part congruent to 2 mod 4. - Vladeta Jovovic, Jul 12 2003. This conjecture was established by Christine Bessenrodt and Jorn B. Olsson (olsson(AT)math.ku.dk), Sep 13 2004.
Also number of partitions of n with some odd part repeated. - Vladeta Jovovic, Feb 05 2005
LINKS
Vaclav Kotesovec, Table of n, a(n) for n = 1..10000
Arvind Ayyer, Hiranya Kishore Dey, and Digjoy Paul, How large is the character degree sum compared to the character table sum for a finite group?, arXiv preprint arXiv:2406.06036 [math.RT], 2024. See p. 6.
Arvind Ayyer, Hiranya Kishore Dey, and Digjoy Paul, On the sum of the entries in a character table, Proc. 36th Conf. Formal Power Series Alg. Comb., Sem. Lotharingien Comb (2024) Vol. 91B, Art. No. 99.
Christine Bessenrodt and Jorn Olsson, On the sequence A085642
Dominique Gouyou-Beauchamps and Philippe Nadeau, Signed Enumeration of Ribbon Tableaux with Local Rules and Generalizations of the Schensted Correspondence, in Formal Power Series and Algebraic Combinatorics, Nankai University, Tianjin, China, 2007.
Dominique Gouyou-Beauchamps and Philippe Nadeau, Signed enumeration of ribbon tableaux: an approach through growth diagrams, Journal of Algebraic Combinatorics, 2011; DOI 10.1007/s10801-011-0324-2.
FORMULA
a(n) ~ exp(Pi*sqrt(2*n/3)) / (4*n*sqrt(3)). - Vaclav Kotesovec, Jul 11 2018
MATHEMATICA
Rest[PartitionsP[Range[0, 47]] - CoefficientList[Series[Product[(1+x^(2 k - 1))/(1 - x^(2 k)), {k, 48}], {x, 0, 47}], x]] (* Wouter Meeussen, Dec 20 2017 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Yuval Dekel (dekelyuval(AT)hotmail.com), Jul 11 2003
EXTENSIONS
Corrected and extended by Vladeta Jovovic, Jul 12 2003
More terms from David Wasserman, Feb 08 2005
STATUS
approved