Sequences

McKay-Thompson series of class 6a for Monster.

McKay-Thompson series of class 6b for the Monster group.

McKay-Thompson series of class 6c for Monster.

Coefficients of completely replicable function "6d".

McKay-Thompson series of class 7A for Monster.

McKay-Thompson series of class 8A for Monster.

McKay-Thompson series of class 9A for Monster.

Expansion of 16 * (1 + k^2)^4 /(k * k'^2)^2 in powers of q where k is the Jacobian elliptic modulus, k' the complementary modulus and q is the nome.

Number of partition graphs on n vertices.

General partition graphs on n vertices.

Low-temperature series for magnetization in zero-field 3-state Potts model on cubic lattice.

Zero-field low-temperature series for 3-state Potts model.

Super ballot numbers: 60*(2n)!/(n!*(n+3)!).

Inverse of 1155th cyclotomic polynomial.

Walks on hexagonal lattice using each point at most twice.

Walks on hexagonal lattice using each point at most three times.

Expansion of free energy series related to Potts model.

Expansion of susceptibility series related to Potts model.

Expansion of susceptibility series related to Potts model.

Number of partitions of n into partition numbers.

Multiplicative encoding of partition triangle.

Number of `(n,2)'-sequences of length 2n.

Number of hexaflexagons with 3n triangles that can be folded from a straight strip of paper.

a(n) = 3*2^n.

Horizontally symmetric numbers.

Minimum diameter of an integral set of n points in the plane, not all on a line.

E.g.f.: (sin x + cos 2x) / cos 3x.

Expansion of layer susceptibility series for cubic lattice.

Expansion of layer susceptibility series for square lattice.

Expansion of e.g.f. (sin(2*x) + cos(x)) / cos(3*x).

a(n) = 2*binomial(n,3).

Series expansion for rectilinear polymers on square lattice.

Number of letters in n (in Hungarian).

Dimension of space of weight systems of chord diagrams.

Number of partitions of n into nonzero triangular numbers.

Number of elements (a b, c d) in GL(2,Z) with |det| = 1, trace <= n and 0 <= a <= {b, c} <= d.

Reversion of (1 + g.f. for primes).

Number of connected graphs on n labeled nodes on a circle with straight-line edges that don't cross.

Sums of consecutive Fibonacci numbers.

Number of Hadamard matrices of order 4n.

a(1)=2, a(2)=5; for n >= 3, a(n) is smallest number which is uniquely of the form a(j) + a(k) with 1 <= j < k < n.

From expansion of exp(sin x).

Optimal cost function between two processors at distance n.

Earliest monotonic sequence fixed (apart from signs) under reversion.

Sphenic numbers: products of 3 distinct primes.

Numerators of Farey (or Stern-Brocot) tree fractions.

Denominators of Farey tree fractions (i.e., the Stern-Brocot subtree in the range [0,1]).

a(n) = a(n-2) + a(n-3), with a(0) = 0, a(1) = 1, a(2) = 2.

Erroneous version of A383108.

a(n) = a(n-2) + a(n-3), with a(0) = 0, a(1) = 1, a(2) = 4.