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.

A033687 Theta series of hexagonal lattice A_2 with respect to deep hole divided by 3.

Original entry on oeis.org

1, 1, 2, 0, 2, 1, 2, 0, 1, 2, 2, 0, 2, 0, 2, 0, 3, 2, 0, 0, 2, 1, 2, 0, 2, 2, 2, 0, 0, 0, 4, 0, 2, 1, 2, 0, 2, 2, 0, 0, 1, 2, 2, 0, 4, 0, 2, 0, 0, 2, 2, 0, 2, 0, 2, 0, 3, 2, 2, 0, 2, 0, 0, 0, 2, 3, 2, 0, 0, 2, 2, 0, 4, 0, 2, 0, 2, 0, 0, 0, 2, 2, 4, 0, 0, 1, 4, 0, 0, 2, 2, 0, 2, 0, 2, 0, 1, 2, 0, 0, 4, 2, 2, 0, 2
Offset: 0

Views

Author

Keywords

Comments

The hexagonal lattice is the familiar 2-dimensional lattice in which each point has 6 neighbors. This is sometimes called the triangular lattice.
a(n)=0 if and only if A000731(n)=0 (see the Han-Ono paper). - Emeric Deutsch, May 16 2008
Number of 3-core partitions of n (denoted c_3(n) in Granville and Ono, p. 340). - Brian Hopkins, May 13 2008
Denoted by g_1(q) in Cynk and Hulek in Remark 3.4 on page 12 (but not explicitly listed).
This is a member of an infinite family of integer weight modular forms. g_1 = A033687, g_2 = A030206, g_3 = A130539, g_4 = A000731. - Michael Somos, Aug 24 2012
Cubic AGM theta functions: a(q) (see A004016), b(q) (A005928), c(q) (A005882).
Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).

Examples

			G.f. = 1 + x + 2*x^2 + 2*x^4 + x^5 + 2*x^6 + x^8 + 2*x^9 + 2*x^10 + 2*x^12 + 2*x^14 + ...
G.f. = q + q^4 + 2*q^7 + 2*q^13 + q^16 + 2*q^19 + q^25 + 2*q^28 + 2*q^31 + 2*q^37 + ...
		

References

  • J. H. Conway and N. J. A. Sloane, "Sphere Packings, Lattices and Groups", Springer-Verlag, p. 111.
  • N. J. Fine, Basic Hypergeometric Series and Applications, Amer. Math. Soc., 1988; p. 79, Eq. (32.35) and (32.351).

Crossrefs

Programs

  • Magma
    Basis( ModularForms( Gamma1(9), 1), 316) [2]; /* Michael Somos, May 06 2015 */
  • Mathematica
    a[ n_] := If[ n < 0, 0, DivisorSum[ 3 n + 1, KroneckerSymbol[ -3, #] &]]; (* Michael Somos, Sep 23 2013 *)
    a[ n_] := SeriesCoefficient[ QPochhammer[ x^3]^3 / QPochhammer[ x], {x, 0, n}]; (* Michael Somos, Sep 01 2015 *)
  • PARI
    {a(n) = if( n<0, 0, sumdiv( 3*n + 1, d, kronecker( -3, d)))}; /* Michael Somos, Nov 03 2005 */
    
  • PARI
    {a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( eta(x^3 + A)^3 / eta(x + A), n))};
    
  • PARI
    {a(n) = my(A, p, e); if( n<0, 0, A = factor( 3*n + 1); prod( k=1, matsize(A)[1], [p, e] = A[k, ]; if( p==3, 0, p%6==1, e+1, 1-e%2)))}; /* Michael Somos, May 06 2015 */
    

Formula

Euler transform of period 3 sequence [1, 1, -2, ...].
Expansion of q^(-1/3) * eta(q^3)^3 / eta(q) in powers of q.
a(4*n + 1) = a(n). - Michael Somos, Dec 06 2004
a(n) = b(3*n + 1) where b(n) is multiplicative and b(p^e) = 0^e if p = 3, b(p^e) = e+1 if p == 1 (mod 6), b(p^e) = (1+(-1)^e)/2 if p == 2, 5 (mod 6). - Michael Somos, May 20 2005
Given g.f. A(x), B(q) = q * A(q^3) satisfies 0 = f(B(q), B(q^2), B(q^4)) where f(u, v, w) = u^2*w - 2*u*w^2 - v^3. - Michael Somos, Dec 06 2004
Given g.f. A(x), B(q)= q * A(q^3) satisfies 0 = f(B(q), B(q^2), B(q^3), B(q^6)) where f(u1, u2, u3, u6) = u1*u3^2 + u1*u6^2 - u1*u3*u6 - u2^2*u3. - Michael Somos, May 20 2005
Given g.f. A(x), B(q) = q * A(q^3) satisfies 0 = f(B(q), B(q^2), B(q^3), B(q^6)) where f(u1, u2, u3, u6) = u2*u3^2 + 2*u2*u3*u6 + 4*u2*u6^2 - u1^2*u6. - Michael Somos, May 20 2005
G.f.: Product_{k>0} (1 - x^(3*k))^3 / (1 - x^k).
G.f.: Sum_{k in Z} x^k / (1 - x^(3*k + 1)) = Sum_{k in Z} x^k / (1 - x^(6*k + 2)). - Michael Somos, Nov 03 2005
Expansion of q^(-1) * c(q^3) / 3 = q^(-1) * (a(q) - b(q)) / 9 in powers of q^3 where a(), b(), c() are cubic AGM theta functions. - Michael Somos, Dec 25 2007
G.f. is a period 1 Fourier series which satisfies f(-1 / (27 t)) = 3^(1/2) (t/i) g(t) where q = exp(2 Pi i t) and g(t) is the g.f. for A005928.
a(n) = Sum_{d|3n+1} LegendreSymbol{d,3} - Brian Hopkins, May 13 2008
q-series for a(n): Sum_{n >= 0} q^(n^2+n)(1-q)(1-q^2)...(1-q^n)/((1-q^(n+1))(1-q^(n+2))...(1-q^(2n+1))). [From Jeremy Lovejoy, Jun 12 2009]
a(n) = A002324(3*n + 1). 3*a(n) = A005882(n) = A033685(3*n + 1). - Michael Somos, Apr 04 2003
G.f.: (2 * psi(x^2) * f(x^2, x^4) + phi(x) * f(x^1, x^5)) / 3 where phi(), psi() are Ramanujan theta functions and f(, ) is Ramanujan's general theta function. - Michael Somos, Sep 07 2018
Sum_{k=1..n} a(k) ~ 2*Pi*n/3^(3/2). - Vaclav Kotesovec, Dec 17 2022

A175595 Square array A(n,t), n>=0, t>=0, read by antidiagonals: A(n,t) is the number of t-core partitions of n.

Original entry on oeis.org

1, 1, 1, 1, 0, 2, 1, 1, 0, 3, 1, 1, 0, 0, 5, 1, 1, 2, 1, 0, 7, 1, 1, 2, 0, 0, 0, 11, 1, 1, 2, 3, 2, 0, 0, 15, 1, 1, 2, 3, 1, 1, 1, 0, 22, 1, 1, 2, 3, 5, 3, 2, 0, 0, 30, 1, 1, 2, 3, 5, 2, 3, 0, 0, 0, 42, 1, 1, 2, 3, 5, 7, 6, 3, 1, 0, 0, 56, 1, 1, 2, 3, 5, 7, 5, 5, 4, 2, 1, 0, 77, 1, 1, 2, 3, 5, 7, 11, 9, 7, 4, 2, 0, 0, 101
Offset: 0

Views

Author

Alois P. Heinz, Dec 03 2010

Keywords

Comments

A partition of n is a t-core partition if none of the hook numbers associated to the Ferrers-Young diagram is a multiple of t. See Chen reference for definitions.

Examples

			A(4,3) = 2, because there are 2 partitions of 4 such that no hook number is a multiple of 3:
   (1)  2 | 4 1
       +1 | 2
       +1 | 1
   -------+-----
   (2)  3 | 4 2 1
       +1 | 1
Square array A(n,t) begins:
   1,  1,  1,  1,  1,  1,  1,  1,  ...
   1,  0,  1,  1,  1,  1,  1,  1,  ...
   2,  0,  0,  2,  2,  2,  2,  2,  ...
   3,  0,  1,  0,  3,  3,  3,  3,  ...
   5,  0,  0,  2,  1,  5,  5,  5,  ...
   7,  0,  0,  1,  3,  2,  7,  7,  ...
  11,  0,  1,  2,  3,  6,  5, 11,  ...
  15,  0,  0,  0,  3,  5,  9,  8,  ...
		

References

  • Garvan, F. G., A number-theoretic crank associated with open bosonic strings. In Number Theory and Cryptography (Sydney, 1989), 221-226, London Math. Soc. Lecture Note Ser., 154, Cambridge Univ. Press, Cambridge, 1990.
  • James, Gordon; and Kerber, Adalbert, The Representation Theory of the Symmetric Group. Addison-Wesley Publishing Co., Reading, Mass., 1981.

Crossrefs

Rows n=0-1 give A000012, A060576.
Diagonal gives A000094(n+1) for n>0.
Upper diagonal gives A000041.
Lower diagonal (conjectured) gives A086642 for n>0.

Programs

  • Maple
    with(numtheory):
    A:= proc(n, t) option remember; `if`(n=0, 1,
          add(add(`if`(t=0 or irem(d, t)=0, d-d*t, d),
                  d=divisors(j))*A(n-j, t), j=1..n)/n)
        end:
    seq(seq(A(n, d-n), n=0..d), d=0..14);
    (From N. J. A. Sloane, Jun 21 2011: to get M terms of the series for t-core partitions:)
    M:=60;
    f:=proc(t) global M; local q,i,t1;
    t1:=1;
    for i from 1 to M+1 do
    t1:=series(t1*(1-q^(i*t))^t,q,M);
    t1:=series(t1/(1-q^i),q,M);
    od;
    t1;
    end;
    # then for example seriestolist(f(5));
  • Mathematica
    n = 13; f[t_] = (1-x^(t*k))^t/(1-x^k); f[0] = 1/(1-x^k);
    s[t_] := CoefficientList[ Series[ Product[ f[t], {k, 1, n}], {x, 0, n}], x]; m = Table[ PadRight[ s[t], n+1], {t, 0, n}]; Flatten[ Table[ m[[j+1-k, k]], {j, n+1}, {k, j}]] (* Jean-François Alcover, Jul 25 2011, after g.f. *)

Formula

G.f. of column t: Product_{i>=1} (1-x^(t*i))^t/(1-x^i).
Column t is the Euler transform of period t sequence [1, .., 1, 1-t, ..].

Extensions

Additional references from N. J. A. Sloane, Jun 21 2011

A182805 Number of 10-core partitions of n.

Original entry on oeis.org

1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 32, 46, 57, 71, 85, 106, 121, 147, 165, 190, 242, 267, 302, 350, 400, 443, 511, 565, 638, 715, 774, 852, 964, 1038, 1135, 1253, 1372, 1482, 1650, 1785, 1878, 2098, 2234, 2411, 2625, 2819, 2963, 3249, 3393, 3600, 4004, 4181
Offset: 0

Views

Author

Alois P. Heinz, Dec 03 2010

Keywords

Crossrefs

Programs

  • Maple
    with(numtheory): A:= proc(n, t) option remember; local d, j; `if`(n=0, 1, add(add(`if`(t=0 or irem(d, t)=0, d-d*t, d), d=divisors(j)) *A(n-j, t), j=1..n)/n) end: seq(A(n,10), n=0..50);
  • Mathematica
    A[n_, t_] := A[n, t] = Module[{d, j}, If[n == 0, 1, Sum[Sum[If[t == 0 || Mod[d, t] == 0, d - d t, d], {d, Divisors[j]}] A[n - j, t], {j, 1, n}]/n]];
    Table[A[n, 10], {n, 0, 50}] (* Jean-François Alcover, Dec 06 2020, after Alois P. Heinz *)

Formula

G.f.: Product_{i>=1} (1-x^(10*i))^10/(1-x^i).
Euler transform of period 10 sequence [1,1,1,1,1,1,1,1,1,-9, .. ].
Showing 1-3 of 3 results.