A122129 Expansion of 1 + Sum_{k>0} x^k^2/((1-x)(1-x^2)...(1-x^(2k))).

1, 1, 1, 2, 3, 4, 5, 7, 9, 12, 15, 19, 24, 30, 37, 46, 57, 69, 84, 102, 123, 148, 177, 211, 252, 299, 353, 417, 491, 576, 675, 789, 920, 1071, 1244, 1442, 1670, 1929, 2224, 2562, 2946, 3381, 3876, 4437, 5072, 5791, 6602, 7517, 8551, 9714, 11021, 12493, 14145

Offset

0,4

Comments

Generating function arises naturally in Rodney Baxter's solution of the Hard Hexagon Model according to George Andrews.

a(n) = number of SE partitions of n, for n >= 1; see A237981. - Clark Kimberling, Mar 19 2014

In Watson 1937 page 275 he writes "Psi_0(1,q) = prod_1^oo (1+q^{2n}) G(q^8)" so this is the expansion in powers of q^2. - Michael Somos, Jun 28 2015

Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).

Rogers-Ramanujan functions: G(x) (see A003114), H(x) (A003106).

From Gus Wiseman, Feb 19 2022: (Start)

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:

(1) (2) (3) (4) (5) (6) (7) (8) (9)

(21) (31) (32) (42) (43) (53) (54)

(211) (41) (51) (52) (62) (63)

(311) (321) (61) (71) (72)

(411) (322) (422) (81)

(421) (431) (432)

(511) (521) (522)

(611) (531)

(3221) (621)

(711)

(4221)

(32211)

The even-length case is A351008. The odd-length case appears to be A122130. Swapping strictly and weakly decreasing relations appears to give A122135. The alternately unequal and equal case is A351006, strict A035457, opposite A351005, even-length A351007.

(End)

References

G. E. Andrews, q-series, CBMS Regional Conference Series in Mathematics, 66, Amer. Math. Soc. 1986, see p. 8, Eq. (1.7). MR0858826 (88b:11063)

G. E. Andrews, R. Askey and R. Roy, Special Functions, Cambridge University Press, 1999; Exercise 6(a), p. 591.

Links

Alois P. Heinz, Table of n, a(n) for n = 0..1000

M. D. Hirschhorn, Some partition theorems of the Rogers-Ramanujan type, J. Combin. Theory Ser. A 27 (1979), no. 1, 33--37. MR0541341 (80j:05010). See Theorem 1. [From N. J. A. Sloane, Mar 19 2012]

Michael Somos, Introduction to Ramanujan theta functions

George N. Watson, The mock theta functions (2), Proc. London Math. Soc., series 2, 42 (1937) 274-304.

Eric Weisstein's World of Mathematics, Ramanujan Theta Functions

Formula

Euler transform of period 20 sequence [ 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, ...].

Expansion of f(-x^2) * f(-x^20) / (f(-x) * f(-x^4,-x^16)) in powers of x where f(,) is the Ramanujan general theta function.

Expansion of f(x^3, x^7) / f(-x, -x^4) in powers of x where f(,) is the Ramanujan general theta function. - Michael Somos, Jun 28 2015

Expansion of f(-x^8, -x^12) / psi(-x) in powers of x where psi() is a Ramanujan theta function. - Michael Somos, Jun 28 2015

Expansion of G(x^4) / chi(-x) in powers of x where chi() is a Ramanujan theta function and G() is a Rogers-Ramanujan function. - Michael Somos, Jun 28 2015

G.f.: Sum_{k>=0} x^k^2 / ((1 - x) * (1 - x^2) ... (1 - x^(2*k))).

G.f.: 1 / (Product_{k>0} (1 - x^(2*k-1)) * (1 - x^(20*k-4)) * (1 - x^(20*k-16))).

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

a(n) ~ (3+sqrt(5))^(1/4) * exp(Pi*sqrt(2*n/5)) / (4*sqrt(5)*n^(3/4)). - Vaclav Kotesovec, Aug 30 2015

Example

Clark Kimberling's SE partition comment, n=6: the 5 SE partitions are [1,1,1,1,1,1] from the partitions 6 and 1^6; [1,1,1,2,1] from 5,1 and 2,1^4; [1,1,3,1] from 4,2 and 2^2,1^2; [2,3,1] from 3,2,1 and 3^2 and 2^3; and [1,2,2,1] from 4,1^2 and 3,1^3. - Wolfdieter Lang, Mar 20 2014
G.f. = 1 + x + x^2 + 2*x^3 + 3*x^4 + 4*x^5 + 5*x^6 + 7*x^7 + 9*x^8 + ...
G.f. = 1/q + q^39 + q^79 + 2*q^119 + 3*q^159 + 4*q^199 + 5*q^239 + ...

Maple

f:=n->1/mul(1-q^(20*k+n), k=0..20);
f(1)*f(3)*f(4)*f(5)*f(7)*f(9)*f(11)*f(13)*f(15)*f(16)*f(17)*f(19);
series(%, q, 200); seriestolist(%); # N. J. A. Sloane, Mar 19 2012.
# second Maple program:
with(numtheory):
a:= proc(n) option remember; `if`(n=0, 1, add(add(d*[0, 1, 0,
       1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1]
      [1+irem(d, 20)], d=divisors(j)) *a(n-j), j=1..n)/n)
    end:
seq(a(n), n=0..60);  # Alois P. Heinz, Jul 12 2013

Mathematica

a[0] = 1; a[n_] := a[n] = Sum[Sum[d*{0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1}[[1+Mod[d, 20]]], {d, Divisors[j]}]*a[n-j], {j, 1, n}]/n; Table[a[n], {n, 0, 60}] (* Jean-François Alcover, Jan 10 2014, after Alois P. Heinz *)
a[ n_] := If[ n < 0, 0, SeriesCoefficient[ Sum[ x^k^2 / QPochhammer[ x, x, 2 k], {k, 0, Sqrt @ n}], {x, 0, n}]]; (* Michael Somos, Jun 28 2015 *)
a[ n_] := SeriesCoefficient[ 1 / (QPochhammer[ x, x^2] QPochhammer[ x^4, x^20] QPochhammer[ x^16, x^20]), {x, 0, n}]; (* Michael Somos, Jun 28 2015 *)

Prog

(PARI)
{a(n) = if( n<0, 0, polcoeff( sum(k=0, sqrtint(n), x^k^2 / prod(i=1, 2*k, 1 - x^i, 1 + x * O(x^(n-k^2)))), n))};

Crossrefs

Cf. A000009, A000041, A000070, A096441, A122134, A351004.

Sequence in context: A306385 A039853 A062188 * A280909 A003413 A100853

Adjacent sequences: A122126 A122127 A122128 * A122130 A122131 A122132

Keyword

nonn

Author

Michael Somos, Aug 21 2006

Status

approved