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

A268188 Sum of the sizes of the Durfee squares of all no-leg partitions of n (or of all no-arm partitions of n).

Original entry on oeis.org

1, 1, 1, 3, 3, 5, 5, 7, 10, 12, 15, 20, 23, 28, 34, 43, 49, 61, 71, 87, 100, 120, 137, 164, 190, 221, 254, 298, 340, 396, 451, 520, 592, 679, 769, 883, 996, 1133, 1278, 1453, 1632, 1850, 2072, 2339, 2620, 2947, 3288, 3695, 4119, 4608, 5129, 5728, 6360, 7091, 7862
Offset: 1

Views

Author

Emeric Deutsch, Jan 29 2016

Keywords

Comments

Given a partition P, the partition formed by the cells situated below the Durfee square of P is called the leg of P. Similarly, the partition formed by the cells situated to the right of the Durfee square of P is called the arm of P.
Conjecture: also a(n) is the number of parts in the partitions of n whose parts differ by at least 2. For example, for n = 5, these partitions are 5, 41 with 3 parts in all. George Beck, Apr 22 2017
Note added Apr 22 2017. George E. Andrews informed me that this is part of the common interpretation of the Rogers-Ramanujan identities. - George Beck

Examples

			a(9)=10 because the no-leg partitions of 9 are [9], [7,2], [6,3], [5,4], and [3,3,3] with sizes of Durfee squares 1,2,2,2, and 3, respectively.
		

References

  • George E. Andrews, "Partitions and Durfee Dissection", Amer. J. Math. 101(1979), 735-742.

Crossrefs

Programs

  • Maple
    g := add(k*x^(k^2)/mul(1-x^i, i = 1 .. k), k = 1 .. 100): gser := series(g, x = 0, 60): seq(coeff(gser, x, n), n = 1 .. 55);
    # second Maple program:
    b:= proc(n, i) option remember; `if`(n=0, 1,
          `if`(i<1, 0, b(n, i-1)+`if`(i>n, 0, b(n-i, i))))
        end:
    a:= n-> add(k*b(n-k^2, k), k=1..floor(sqrt(n))):
    seq(a(n), n=1..60);  # Alois P. Heinz, Jan 30 2016
  • Mathematica
    b[n_, i_] := b[n, i] = If[n == 0, 1, If[i < 1, 0, b[n, i - 1] + If[i > n, 0, b[n - i, i]]]]; a[n_] := Sum[k*b[n - k^2, k], {k, 1, Floor[Sqrt[n]]}]; Table[a[n], {n, 1, 60}] (* Jean-François Alcover, Dec 21 2016, after Alois P. Heinz *)

Formula

a(n) = Sum_{k>=1} k*A268187(n,k).
G.f.: g = Sum_{k>=1} (k*x^(k^2)/Product_{i=1..k}(1-x^i)).
a(n) ~ 3^(1/4) * log(phi) * phi^(1/2) * exp(2*Pi*sqrt(n/15)) / (2*Pi*n^(1/4)), where phi = A001622 = (1+sqrt(5))/2 is the golden ratio. - Vaclav Kotesovec, Mar 09 2020

A333155 Decimal expansion of a constant related to the asymptotics of A268188 and A333153.

Original entry on oeis.org

5, 9, 3, 2, 4, 2, 2, 1, 5, 0, 0, 3, 3, 6, 9, 1, 2, 7, 1, 8, 4, 1, 3, 7, 6, 1, 7, 3, 3, 0, 2, 5, 5, 9, 5, 4, 1, 1, 0, 9, 9, 5, 9, 5, 4, 9, 6, 2, 7, 9, 5, 7, 4, 2, 9, 0, 6, 0, 2, 4, 5, 7, 8, 6, 0, 4, 5, 3, 5, 9, 2, 2, 3, 8, 5, 4, 6, 8, 1, 3, 3, 3, 3, 2, 5, 5, 0, 4, 8, 0, 7, 2, 0, 2, 8, 1, 9, 6, 6, 3, 9, 7, 1, 0, 7, 1
Offset: 0

Views

Author

Vaclav Kotesovec, Mar 09 2020

Keywords

Examples

			0.5932422150033691271841376173302559541109959549627957429060245786...
		

Crossrefs

Programs

  • Maple
    evalf(sqrt(15) * log((sqrt(5) + 1)/2) / Pi, 120);
  • Mathematica
    RealDigits[Sqrt[15]*Log[GoldenRatio]/Pi, 10, 105][[1]]

Formula

Equals sqrt(15) * log(phi) / Pi, where phi = A001622 = (1+sqrt(5))/2 is the golden ratio.
If m >= 0 and g.f. is Sum_{k>=1} (k^m * x^(k^2) / Product_{j=1..k} (1 - x^j)), then a(n) ~ A333155^m * phi^(1/2) * exp(2*Pi*sqrt(n/15)) * n^((2*m-3)/4) / (2 * 3^(1/4) * 5^(1/2)).
If m >= 0 and g.f. is Sum_{k>=1} (k^m * x^(k*(k+1)) / Product_{j=1..k} (1 - x^j)), then a(n) ~ A333155^m * exp(2*Pi*sqrt(n/15)) * n^((2*m-3)/4) / (2 * 3^(1/4) * 5^(1/2) * phi^(1/2)).
Showing 1-2 of 2 results.