cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-5 of 5 results.

A122135 Expansion of f(x, -x^4) / phi(-x^2) in powers of x where f(, ) and phi() are Ramanujan theta functions.

Original entry on oeis.org

1, 1, 2, 2, 3, 4, 6, 7, 10, 12, 16, 20, 26, 31, 40, 48, 60, 72, 89, 106, 130, 154, 186, 220, 264, 310, 370, 433, 512, 598, 704, 818, 958, 1110, 1293, 1494, 1734, 1996, 2308, 2650, 3052, 3496, 4014, 4584, 5248, 5980, 6825, 7760, 8834, 10020, 11380, 12882, 14594
Offset: 0

Views

Author

Michael Somos, Aug 21 2006

Keywords

Comments

Generating function arises naturally in Rodney Baxter's solution of the Hard Hexagon Model according to George Andrews.
Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
From Gus Wiseman, Feb 26 2022: (Start)
Conjecture: Also the number of integer partitions y of n such that y_i > y_{i+1} for all even i. For example, the a(1) = 1 through a(9) = 12 partitions are:
(1) (2) (3) (4) (5) (6) (7) (8) (9)
(11) (21) (22) (32) (33) (43) (44) (54)
(31) (41) (42) (52) (53) (63)
(221) (51) (61) (62) (72)
(321) (331) (71) (81)
(2211) (421) (332) (432)
(3211) (431) (441)
(521) (531)
(3311) (621)
(4211) (3321)
(4311)
(5211)
The even-length case appears to be A122134.
The odd-length case is A351595.
The alternately unequal version appears to be A122129, even A351008, odd A122130.
The alternately equal version is A351003, even A351012, odd A000009.
The alternately equal and unequal version is A351005, even A035457, odd A351593.
The alternately unequal and equal version is A351006, even A351007, odd A053251. (End)
For Wiseman's conjecture above and three other partition-theoretic interpretations of this sequence see Connor, Proposition 4. - Peter Bala, Jan 02 2025

Examples

			G.f. = 1 + x + 2*x^2 + 2*x^3 + 3*x^4 + 4*x^5 + 6*x^6 + 7*x^7 + 10*x^8 + ...
G.f. = q^9 + q^49 + 2*q^89 + 2*q^129 + 3*q^169 + 4*q^209 + 6*q^249 + ...
		

References

  • G. E. Andrews, q-series, CBMS Regional Conference Series in Mathematics, 66, Amer. Math. Soc. 1986, see p. 8, Eq. (1.5). MR0858826 (88b:11063)
  • G. E. Andrews, R. Askey and R. Roy, Special Functions, Cambridge University Press, 1999; Exercise 6(d), p. 591.

Crossrefs

Programs

  • Maple
    f:=n->1/mul(1-q^(20*k+n),k=0..20);
    f(1)*f(2)*f(5)*f(6)*f(8)*f(9)*f(11)*f(12)*f(14)*f(15)*f(18)*f(19);
    series(%,q,200); seriestolist(%); # N. J. A. Sloane, Mar 19 2012
  • Mathematica
    a[ n_] := SeriesCoefficient[ QPochhammer[ -x, -x^5] QPochhammer[ x^4, -x^5] QPochhammer[-x^5] / EllipticTheta[ 4, 0, x^2], {x, 0, n}]; (* Michael Somos, Nov 12 2016 *)
    nmax = 50; CoefficientList[Series[Product[1/((1 - x^(20*k+1))*(1 - x^(20*k+2))*(1 - x^(20*k+5))*(1 - x^(20*k+6))*(1 - x^(20*k+8))*(1 - x^(20*k+9))*(1 - x^(20*k+11))*(1 - x^(20*k+12))*(1 - x^(20*k+14))*(1 - x^(20*k+15))*(1 - x^(20*k+18))*(1 - x^(20*k+19)) ), {k, 0, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Nov 12 2016 *)
  • PARI
    {a(n) = if( n<0, 0, polcoeff( sum(k=0, (sqrtint(4*n+1) - 1) \2, x^(k^2 + k) / prod(i=1, 2*k+1, 1 - x^i, 1 + x * O(x^(n-k^2-k)))), n))};

Formula

Expansion of f(x^2, x^8) / f(-x, -x^4) in powers of x where f(, ) is Ramanujan's general theta function. - Michael Somos, Nov 12 2016
Expansion of f(-x^3, -x^7) * f(-x^4, -x^16) / ( f(-x) * f(-x^20) ) in powers of x where f(, ) is Ramanujan's general theta function.
Euler transform of period 20 sequence [ 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, ...].
G.f.: Sum_{k>=0} x^(k^2 + k) / ((1 - x) * (1 - x^2) * ... * (1 - x^(2*k+1))).
Let f(n) = 1/Product_{k >= 0} (1-q^(20k+n)). Then g.f. is f(1)*f(2)*f(5)*f(6)*f(8)*f(9)*f(11)*f(12)*f(14)*f(15)*f(18)*f(19); - N. J. A. Sloane, Mar 19 2012.
a(n) ~ (3 + sqrt(5))^(1/4) * exp(Pi*sqrt(2*n/5)) / (4*sqrt(5)*n^(3/4)). - Vaclav Kotesovec, Nov 12 2016

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

Original entry on oeis.org

1, 0, 1, 1, 2, 2, 4, 4, 6, 7, 10, 11, 16, 18, 24, 28, 36, 42, 54, 62, 78, 91, 112, 130, 159, 184, 222, 258, 308, 356, 424, 488, 576, 664, 778, 894, 1044, 1196, 1389, 1590, 1838, 2098, 2419, 2754, 3162, 3596, 4114, 4668, 5328, 6032, 6864, 7760, 8806, 9936, 11252
Offset: 0

Views

Author

Michael Somos, Aug 21 2006, Oct 10 2007

Keywords

Comments

Generating function arises naturally in Rodney Baxter's solution of the Hard Hexagon Model according to George Andrews.
In Watson 1937 page 275 he writes "Psi_0(q^{1/2},q) = prod_1^oo (1+q^{2n}) G(-q^2)" so this is the expansion in powers of q^2. - Michael Somos, Jun 29 2015
Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
Rogers-Ramanujan functions: G(q) (see A003114), H(q) (A003106).
From Gus Wiseman, Feb 26 2022: (Start)
Conjecture: Also the number of even-length integer partitions y of n such that y_i != y_{i+1} for all even i. For example, the a(2) = 1 through a(9) = 7 partitions are:
(11) (21) (22) (32) (33) (43) (44) (54)
(31) (41) (42) (52) (53) (63)
(51) (61) (62) (72)
(2211) (3211) (71) (81)
(3311) (3321)
(4211) (4311)
(5211)
This appears to be the even-length version of A122135.
The odd-length version is A351595.
For Wiseman's conjecture above and three other partition-theoretic interpretations of this sequence see Connor, Proposition 3. - Peter Bala, Jan 02 2025

Examples

			G.f. = 1 + x^2 + x^3 + 2*x^4 + 2*x^5 + 4*x^6 + 4*x^7 + 6*x^8 + 7*x^9 + ...
G.f. = q + q^81 + q^121 + 2*q^161 + 2*q^201 + 4*q^241 + 4*q^281 + ...
		

References

  • G. E. Andrews, R. Askey and R. Roy, Special Functions, Cambridge University Press, 1999; Exercise 6(c), p. 591.
  • G. E. Andrews, q-series, CBMS Regional Conference Series in Mathematics, 66, Amer. Math. Soc. 1986, see p. 8, Eq. (1.6). MR0858826 (88b:11063)

Crossrefs

Programs

  • Mathematica
    a[ n_] := If[ n < 0, 0, SeriesCoefficient[ Sum[ x^(k^2 + k) / QPochhammer[ x, x, 2 k], {k, 0, (Sqrt[ 4 n + 1] - 1) / 2}], {x, 0, n}]]; (* Michael Somos, Jun 29 2015 *)
    a[ n_] := SeriesCoefficient [ 1 / (QPochhammer[ x^4, -x^5] QPochhammer[ -x, -x^5] QPochhammer[ x, x^2]), {x, 0, n}]; (* Michael Somos, Jun 29 2015 *)
    a[ n_] := SeriesCoefficient[ QPochhammer[ x^2, -x^5] QPochhammer[ -x^3, -x^5] QPochhammer[ -x^5] / EllipticTheta[ 4, 0, x^2], {x, 0, n}]; (* Michael Somos, Jun 29 2015 *)
    nmax = 50; CoefficientList[Series[Product[1/((1 - x^(20*k+2))*(1 - x^(20*k+3))*(1 - x^(20*k+4))*(1 - x^(20*k+5))*(1 - x^(20*k+6))*(1 - x^(20*k+7))*(1 - x^(20*k+13))*(1 - x^(20*k+14))*(1 - x^(20*k+15))*(1 - x^(20*k+16))*(1 - x^(20*k+17)) *(1 - x^(20*k+18))), {k, 0, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Nov 12 2016 *)
  • PARI
    {a(n) = if( n<0, 0, polcoeff( sum(k=0, (sqrtint(4*n + 1) - 1)\2, x^(k^2 + k) / prod(i=1, 2*k, 1 - x^i, 1 + x * O(x^(n -k^2-k)))), n))};

Formula

Euler transform of period 20 sequence [ 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, ...].
Expansion of f(x^4, x^6) / f(-x^2, -x^3) in powers of x where f(, ) is the Ramanujan general theta function. - Michael Somos, Jun 29 2015
Expansion of f(-x^2, x^3) / phi(-x^2) in powers of x where phi() is a Ramanujan theta function. - Michael Somos, Jun 29 2015
Expansion of G(-x) / chi(-x) in powers of x where chi() is a Ramanujan theta function and G() is a Rogers-Ramanujan function. - Michael Somos, Jun 29 2015
G.f.: Sum_{k>=0} x^(k^2 + k) / ((1 - x) * (1 - x^2) * ... * (1 - x^(2*k))).
Expansion of f(-x, -x^9) * f(-x^8, -x^12) / ( f(-x) * f(-x^20) ) in powers of x where f(, ) is the Ramanujan general theta function.
a(n) = number of partitions of n into parts that are each either == 2, 3, ..., 7 (mod 20) or == 13, 14, ..., 18 (mod 20). - Michael Somos, Jun 29 2015 [corrected by Vaclav Kotesovec, Nov 12 2016]
a(n) ~ (3 - sqrt(5))^(1/4) * exp(Pi*sqrt(2*n/5)) / (4*sqrt(5)*n^(3/4)). - Vaclav Kotesovec, Nov 12 2016

A122130 Expansion of f(-x^4, -x^16) / psi(-x) in powers of x where psi() is a Ramanujan theta function and f(, ) is Ramanujan's general theta function.

Original entry on oeis.org

1, 1, 1, 2, 2, 3, 4, 5, 7, 9, 11, 14, 18, 22, 27, 34, 41, 50, 61, 73, 88, 106, 126, 150, 179, 211, 249, 294, 345, 404, 473, 551, 642, 747, 865, 1002, 1159, 1336, 1539, 1771, 2033, 2331, 2670, 3052, 3485, 3976, 4527, 5150, 5854, 6642, 7530, 8529, 9647, 10902
Offset: 0

Views

Author

Michael Somos, Aug 21 2006, corrected Aug 21 2006

Keywords

Comments

Generating function arises naturally in Rodney Baxter's solution of the Hard Hexagon Model according to George Andrews.
Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
From Gus Wiseman, Feb 19 2022: (Start)
This appears to be the number of odd-length alternately strict integer partitions of n + 1, i.e., partitions y such that y_i != y_{i+1} for all odd i. For example, the a(1) = 1 through a(9) = 7 partitions are:
(1) (2) (3) (4) (5) (6) (7) (8) (9)
(211) (311) (321) (322) (422) (432)
(411) (421) (431) (522)
(511) (521) (531)
(611) (621)
(711)
(32211)
The even-length version is A351008. Including even-length partitions appears to give A122129. Swapping strictly and weakly decreasing relations gives A351595. The constant instead of strict version is A351594. (End)
Wiseman's first conjecture above was proved by Connor, Proposition 2. - Peter Bala, Dec 22 2024

Examples

			G.f. = 1 + x + x^2 + 2*x^3 + 2*x^4 + 3*x^5 + 4*x^6 + 5*x^7 + 7*x^8 + 9*x^9 + ...
G.f. = q^31 + q^71 + q^111 + 2*q^151 + 2*q^191 + 3*q^231 + 4*q^271 + 5*q^311 + ...
		

References

  • G. E. Andrews, R. Askey and R. Roy, Special Functions, Cambridge University Press, 1999; Exercise 6(b), p. 591.
  • G. E. Andrews, q-series, CBMS Regional Conference Series in Mathematics, 66, Amer. Math. Soc. 1986, see p. 8, Eq. (1.8). MR0858826 (88b:11063)

Crossrefs

Programs

  • Mathematica
    nmax = 100; CoefficientList[Series[Product[1/((1-x^(2*k-1))*(1-x^(20*k-8))*(1-x^(20*k-12))), {k, 1, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Aug 30 2015 *)
    a[ n_] := SeriesCoefficient[ 1 / (QPochhammer[x, x^2] QPochhammer[x^8, x^20] QPochhammer[x^12, x^20]), {x, 0, n}]; (* Michael Somos, Nov 12 2016 *)
    a[ n_] := SeriesCoefficient[ Sqrt[2] x^(1/8) QPochhammer[ x^4, x^20] QPochhammer[ x^16, x^20] QPochhammer[x^20] / EllipticTheta[ 2, Pi/4, x^(1/2)], {x, 0, n}] // Simplify; (* Michael Somos, Nov 12 2016 *)
  • PARI
    {a(n) = if( n<1, n==0, polcoeff( sum(k=1, sqrtint(n+1), x^(k^2-1) / prod(i=1, 2*k-1, 1 - x^i, 1 + x * O(x^(n-k^2+1)))), n))};

Formula

Expansion of f(x, x^9) / f(-x^2, -x^3) in powers of x where f(, ) is Ramanujan's general theta function. - Michael Somos, Nov 12 2016
Expansion of f(-x^2) * f(-x^20) / (f(-x) * f(-x^8, -x^12)) in powers of x where f(-x) : = f(-x, -x^2) and f(, ) is Ramanujan's general theta function.
Euler transform of period 20 sequence [ 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, ...].
G.f.: Sum_{k>0} x^(k^2 - 1) / ((1 - x) * (1 - x^2) * ... * (1 - x^(2k-1))).
G.f.: 1/(Product_{k>0} (1-x^(2k-1))(1-x^(20k-8))(1-x^(20k-12))).
a(n) ~ (3-sqrt(5))^(1/4) * exp(Pi*sqrt(2*n/5)) / (4*sqrt(5)*n^(3/4)). - Vaclav Kotesovec, Aug 30 2015

A351593 Number of odd-length integer partitions of n into parts that are alternately equal and strictly decreasing.

Original entry on oeis.org

0, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 4, 2, 4, 3, 5, 4, 6, 4, 8, 6, 9, 6, 12, 7, 14, 10, 16, 11, 20, 13, 24, 16, 28, 18, 34, 21, 40, 26, 46, 30, 56, 34, 64, 41, 75, 48, 88, 54, 102, 64, 118, 73, 138, 84, 159, 98, 182, 112, 210, 128, 242, 148, 276, 168, 318
Offset: 0

Views

Author

Gus Wiseman, Feb 23 2022

Keywords

Comments

Also odd-length partitions whose run-lengths are all 2's, except for the last, which is 1.

Examples

			The a(1) = 1 through a(15) = 6 partitions (A..F = 10..15):
  1  2  3  4  5    6  7    8    9    A    B      C    D      E    F
              221     331  332  441  442  443    552  553    554  663
                                          551         661    662  771
                                          33221       44221       44331
                                                                  55221
		

Crossrefs

The even-length ordered version is A003242, ranked by A351010.
The opposite version is A053251, even-length A351007, any length A351006.
This is the odd-length case of A351005, even-length A035457.
With only equalities we get:
- opposite any length: A351003
- opposite odd-length: A000009 (except at 0)
- opposite even-length: A351012
- any length: A351004
- odd-length: A351594
- even-length: A035363
Without equalities we get:
- opposite any length: A122129 (apparently)
- opposite odd-length: A122130 (apparently)
- opposite even-length: A351008
- any length: A122135 (apparently)
- odd-length: A351595
- even-length: A122134 (apparently)

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],OddQ[Length[#]]&&And@@Table[If[EvenQ[i],#[[i]]!=#[[i+1]],#[[i]]==#[[i+1]]],{i,Length[#]-1}]&]],{n,0,30}]

A351594 Number of odd-length integer partitions y of n that are alternately constant, meaning y_i = y_{i+1} for all odd i.

Original entry on oeis.org

0, 1, 1, 2, 1, 3, 2, 4, 2, 7, 3, 9, 4, 13, 6, 19, 6, 26, 10, 35, 12, 49, 16, 64, 20, 87, 27, 115, 32, 151, 44, 195, 53, 256, 69, 328, 84, 421, 108, 537, 130, 682, 167, 859, 202, 1085, 252, 1354, 305, 1694, 380, 2104, 456, 2609, 564, 3218, 676, 3968, 826, 4863
Offset: 0

Views

Author

Gus Wiseman, Feb 24 2022

Keywords

Comments

These are partitions with all even run-lengths except for the last, which is odd.

Examples

			The a(1) = 1 through a(9) = 7 partitions:
  (1)  (2)  (3)    (4)  (5)      (6)    (7)        (8)    (9)
            (111)       (221)    (222)  (331)      (332)  (333)
                        (11111)         (22111)           (441)
                                        (1111111)         (22221)
                                                          (33111)
                                                          (2211111)
                                                          (111111111)
		

Crossrefs

The ordered version (compositions) is A016116 shifted right once.
All odd-length partitions are counted by A027193.
The opposite version is A117409, even-length A351012, any length A351003.
Replacing equal with unequal relations appears to give:
- any length: A122129
- odd length: A122130
- even length: A351008
- opposite any length: A122135
- opposite odd length: A351595
- opposite even length: A122134
This is the odd-length case of A351004, even-length A035363.
The case that is also strict at even indices is:
- any length: A351005
- odd length: A351593
- even length: A035457
- opposite any length: A351006
- opposite odd length: A053251
- opposite even length: A351007
A reverse version is A096441; see also A349060.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],OddQ[Length[#]]&&And@@Table[#[[i]]==#[[i+1]],{i,1,Length[#]-1,2}]&]],{n,0,30}]
Showing 1-5 of 5 results.