Sequences

Hypotenusal numbers.

Largest number not the sum of distinct positive n-th powers.

Coefficients of Airey's converging factor.

Linear coefficient of the n-th converging polynomial of Weber functions (Erroneous version).

Quadratic coefficient of the n-th converging polynomial of Weber functions.

Number of self-avoiding n-step walks on Kagome lattice.

Number of n-step self-avoiding walks on b.c.c. lattice (version 2).

2n-step polygons on b.c.c. lattice.

Number of self-avoiding n-step walks on honeycomb lattice.

Number of 7-level labeled rooted trees with n leaves.

k appears k times (k even).

Powers of e rounded up.

a(n) = floor(Pi^n).

a(n) = ceiling(Pi^n).

a(n) = floor(sqrt( 2*Pi )^n).

a(n) = round(sqrt( 2*Pi )^n).

Number of h-cobordism classes of smooth homotopy n-spheres.

Number of series-parallel networks with n edges.

Number of series-reduced planted trees with n nodes.

Number of series-reduced rooted trees with n nodes.

The partition function G(n,3).

The partition function G(n,4).

Numbers k such that 3^k, 3^(k+1) and 3^(k+2) have the same number of digits.

Number of one-sided triangulations of the disk; or flexagons of order n; or unlabeled plane trivalent trees (n-2 internal vertices, all of degree 3 and hence n leaves).

From a continued fraction.

a(0) = 1, a(1) = 2, a(2) = 3; for n >= 3, a(n) = a(n-2) + a(n-1)*Product_{i=1..n-3} a(i).

From a continued fraction.

a(n) = a(n-2) + a(n-5).

4th forward differences of factorial numbers A000142.

5th forward differences of factorial numbers A000142.

Non-Fibonacci numbers.

Number of two-element generating sets in the symmetric group S_n.

Number of irreducible polynomials of degree n over GF(5); dimensions of free Lie algebras.

Number of degree-n irreducible polynomials over GF(7); dimensions of free Lie algebras.

Powerful numbers, definition (1): if a prime p divides n then p^2 must also divide n (also called squareful, square full, square-full or 2-powerful numbers).

a(n) = H_n(2,n) where H_n is the n-th hyperoperator.

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

a(n+1) = a(n)(a(0) + ... + a(n)).

a(n) = ceiling(sqrt( 2*Pi )^n).

Number of binary trees of height n; or products (ways to insert parentheses) of height n when multiplication is non-commutative and non-associative.

a(n) = binomial(2*n+1, n+1): number of ways to put n+1 indistinguishable balls into n+1 distinguishable boxes = number of (n+1)-st degree monomials in n+1 variables = number of monotone maps from 1..n+1 to 1..n+1.

Generalized Stirling numbers, [n+2,n]_2.

Generalized Stirling numbers, [n+3,n]_2.

Decimal concatenation of n, n+1, and n+2.

a(n) = n concatenated with n + 1.

Generalized Stirling numbers, [n+2,3]_2: a(n) = n! * Sum_{k=0..n-1} (k+1)/(n-k).

Generalized Stirling numbers, [n+4,4]_2.

Generalized Stirling numbers, [n+5,5]_2.

Generalized Stirling numbers, [n+6,6]_2.

Generalized Stirling numbers, [n+7,7]_2.