Sequences

Number of n-step self-avoiding walks on cubic lattice ending at point with x=1.

Number of n-step self-avoiding walks on cubic lattice ending at point with x=2.

Number of n-step self-avoiding walks on cubic lattice ending at point with x=3.

Number of interval orders constructed from n intervals of generic lengths.

Boustrophedon transform of Bell numbers.

Number of n-step self-avoiding walks on f.c.c. lattice ending at point with x = 0.

Number of n-step self-avoiding walks on f.c.c. lattice ending at point with x = 1.

Number of n-step self-avoiding walks on f.c.c. lattice ending at point with x = 2.

Number of n-step self-avoiding walks on f.c.c. lattice ending at point with x = 3.

No-3-in-line problem: number of inequivalent ways of placing 2n points on an n X n grid so that no 3 are in a line.

Stirling numbers of the second kind, S(n,6).

Stirling numbers of second kind, S(n,7).

E.g.f. exp(tan(x) + sec(x) - 1).

Number of numbers == 0 (mod 3) in range 2^n to 2^(n+1) with odd number of 1's in binary expansion.

a(n) = n!*(1 + Sum_{i=1..n} 1/i).

a(n) = n! * (n + 1 + 2*Sum_{k=1...n} 1/k).

a(n) = n! * (1 + 2*Sum_{k=1..n} 1/k).

a(n) = (n+2)*Catalan(n) - 1.

a(n) = Catalan(n) + Catalan(n+1) - 1.

a(n) = 2*(2n-1)!!-(n-1)!*2^(n-1), where (2n-1)!! is A001147(n).

a(n) = (n+1)!/2 + (n-1)(n-1)!.

a(n) = 3*Catalan(n) - Catalan(n-1) - 1.

a(n) = 2*Catalan(n) - Catalan(n-1).

Erroneous version of A007535.

Number of symmetrical planar partitions of n (planar partitions (A000219) that when regarded as 3-D objects have just one symmetry plane).

Number of asymmetrical planar partitions of n: planar partitions (A000219) that when regarded as 3-D objects have no symmetry.

Number of inequivalent planar partitions of n, when considering them as 3D objects.

Strobogrammatic numbers: the same upside down.

Total number of 1's in binary expansions of 0, ..., n.

Maximal order of a triangle-free cyclic graph with no independent set of size n.

Primary pretenders: least composite c such that n^c == n (mod c).

Ramsey numbers R(3,n).

a(n) = max{(n - i)*a(i) : i < n}; a(0) = 1.

Landau's function g(n): largest order of permutation of n elements. Equivalently, largest LCM of partitions of n.

Permanent of the Desarguesian projective plane PG(2,n), or 0 if such plane does not exist.

Salié numbers: expansion of cosh x / cos x = Sum_{n >= 0} a(n)*x^(2n)/(2n)!.

Decimal expansion of Pi (or digits of Pi).

Numbers that are not the sum of 4 tetrahedral numbers.

Number of different quasi-orders (or topologies, or transitive digraphs) with n labeled elements.

a(n) = floor(2^n / n).

Sum of upward diagonals of Eulerian triangle.

a(n) = Sum_{k = 1..n} floor(2^k / k).

Maximal number of states in the minimal deterministic finite automaton accepting a language over a binary alphabet consisting of some words of length n.

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

Permanent of a certain cyclic n X n (0,1) matrix.

Permanent of a certain cyclic n X n (0,1) matrix.

Bessel polynomial y_n(-1).

Quadratic invariants.

Number of switching networks (see Harrison reference for precise definition).

Number of switching networks (see Harrison reference for precise definition).