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-3 of 3 results.

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

A351595 Number of odd-length integer partitions y of n such that y_i > y_{i+1} for all even i.

Original entry on oeis.org

0, 1, 1, 1, 1, 2, 2, 3, 4, 5, 6, 9, 10, 13, 16, 20, 24, 30, 35, 44, 52, 63, 74, 90, 105, 126, 148, 175, 204, 242, 280, 330, 382, 446, 515, 600, 690, 800, 919, 1060, 1214, 1398, 1595, 1830, 2086, 2384, 2711, 3092, 3506, 3988, 4516, 5122, 5788, 6552, 7388, 8345
Offset: 0

Views

Author

Gus Wiseman, Feb 25 2022

Keywords

Examples

			The a(1) = 1 through a(12) = 10 partitions (A..C = 10..12):
  1   2   3   4   5     6     7     8     9     A     B       C
                  221   321   331   332   432   442   443     543
                              421   431   441   532   542     552
                                    521   531   541   551     642
                                          621   631   632     651
                                                721   641     732
                                                      731     741
                                                      821     831
                                                      33221   921
                                                              43221
		

Crossrefs

The ordered version (compositions) is A000213 shifted right once.
All odd-length partitions are counted by A027193.
The opposite appears to be A122130, even-length A351008, any length A122129.
This appears to be the odd-length case of A122135, even-length A122134.
The case that is constant at odd indices:
- any length: A351005
- odd length: A351593
- even length: A035457
- opposite any length: A351006
- opposite odd length: A053251
- opposite even length: A351007
For equality instead of inequality:
- any length: A351003
- odd-length: A000009 (except at 0)
- even-length: A351012
- opposite any length: A351004
- opposite odd-length: A351594
- opposite even-length: A035363

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],OddQ[Length[#]]&&And@@Table[#[[i]]>#[[i+1]],{i,2,Length[#]-1,2}]&]],{n,0,30}]

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}]
Showing 1-3 of 3 results.