proposed
approved
Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
proposed
approved
editing
proposed
Watson, G. N. (1937), "The Mock Theta Functions (2)", Proceedings of the London Mathematical Society, s2-42: 274-304, doi:10.1112/plms/s2-42.1.274
George N. Watson, <a href="https://doi.org/10.1112/plms/s2-42.1.274">The mock theta functions (2)</a>, Proc. London Math. Soc., series 2, 42 (1937) 274-304.
proposed
editing
editing
proposed
a(n) = number of SE partitions of n, for n >= 1; see A237981. _- _Clark Kimberling_, Mar 19 2014
Let f(n) = 1/Product_{k >= 0} (1 - q^(20k+n)). Then g.f. is f(1)*f(3)*f(4)*f(5)*f(7)*f(9)*f(11)*f(13)*f(15)*f(16)*f(17)*f(19). - N. J. A. Sloane, Mar 19 2012.
a(n) = is the number of partitions of n into parts that are either odd or == +/-4 (mod 20). - Michael Somos, Jun 28 2015
proposed
editing
editing
proposed
This appears to be the number of integer partitions of n with every other pair of adjacent parts strictly decreasing, as in the pattern a > b >= c > d >= e for a partition (a, b, c, d, e). For example, the a(1) = 1 through a(9) = 12 partitions are:
proposed
editing
editing
proposed