Sequences

Bond percolation series for mean cluster size on directed cubic lattice.

Percolation series for b.c.c. lattice.

Percolation series for f.c.c. lattice.

Percolation series for directed hexagonal lattice.

Related to self-avoiding walks on square lattice.

Related to self-avoiding walks on square lattice.

Related to self-avoiding walks on square lattice.

Trails of length n on square lattice.

Trails of length n on hexagonal lattice.

Trails of length n on cubic lattice.

Number of connected regular simple graphs of degree 4 (or quartic graphs) with n nodes.

Number of connected regular graphs of degree 5 (or quintic graphs) with 2n nodes.

Number of connected regular graphs of degree 6 (or sextic graphs) with n nodes.

Number of connected trivalent bipartite graphs with 2n nodes.

Number of connected regular bipartite graphs of degree 4 with 2n nodes.

Number of connected regular bipartite graphs of degree 5 with 2n nodes.

Erroneous version of A003182.

Number of partitions of 2n with all subsums different from n.

From fundamental unit of Z[ (-d)^{1/4} ], where d runs over positive integers not of the form 4*k^4.

From fundamental unit of Z[ (-n)^{1/4} ].

From fundamental unit of Z[ (-n)^1/4 ].

From fundamental unit of Z[ (-n)^{1/4} ].

Discriminants of totally real cubic fields.

Decimal expansion of neutron-to-electron mass ratio.

Decimal expansion of neutron-to-proton mass ratio.

Percolation series for directed square lattice.

Percolation series for directed hexagonal lattice.

Site percolation series for directed cubic lattice.

Percolation series for directed b.c.c. lattice.

Minimum of largest partial quotient of continued fraction for k/n, (k,n) = 1.

Number of 2n-bead black-white reversible complementable necklaces with n black beads.

Permutation arrays of period n.

Triangle read by rows: row n gives numerators of Farey series of order n.

Triangle read by rows: row n gives denominators of Farey series of order n.

a(1)=4, a(2)=5; thereafter a(n) is smallest number that is greater than a(n-1) and having a unique representation as a(j) + a(k) for j<k.

State assignments for n-state machine.

Hammersley's polynomial p_n(1).

Number of extreme points of the set of n X n symmetric doubly-stochastic matrices.

Number of extreme points of the set of n X n symmetric doubly-substochastic matrices.

Number of strongly self-dual planar maps with 2n edges.

Exponential self-convolution of numbers of rooted trees on n nodes.

Trails of length n on honeycomb lattice.

Step at which n is expelled in Kimberling's puzzle (A035486).

Balanced colorings of n-cube.

Nonantipodal balanced colorings of n-cube.

Maximum number of edges in an n-node squarefree graph, or, in a graph containing no 4-cycle, or no C_4.

Maximal number of edges in n-node graph of girth at least 5.

a(n) = binomial(n+5,5) * binomial(n+5,4)/(n+5).

Expansion of g.f. x*(1 + x)*(1 + 6*x + x^2)/(1 - x)^7.

From paths in the plane.