Sequences

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

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

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

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

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

a(1) = a(2) = 1; thereafter a(2n+1) = a(n+1) + a(n), a(2n) = 2a(n).

a(0)=0, a(1)=a(2)=1; for n >= 1, a(3n+2) = 2a(n+1) + a(n), a(3n+1) = a(n+1) + 2a(n), a(3n) = 3a(n).

Number of factorization patterns of polynomials of degree n over F_2.

Number of factorization patterns of polynomials of degree n over F_3.

Number of factorization patterns of polynomials of degree n over F_4.

Number of factorization patterns of polynomials of degree n over F_5.

Number of factorization patterns of polynomials of degree n over integers.

a(n) = 1 + F(2*n+1) + (-1)^n*L(n).

Witt vector *2!.

Witt vector *3!.

Witt vector *4!.

Witt vector *5!.

Witt vector *2!/2!.

Witt vector *3!/3!.

Witt vector *4!/4!.

Witt vector *5!/5!.

Maximal partial Steiner triple systems of order n.

Deficiencies of partial Steiner triple systems of order n.

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

Number of cycles in the complement of a path.

Number of pair-coverings with largest block size 3.

Number of pair-coverings with largest block size 4.

Number of pair-coverings with largest block size 5.

Maximal cycles in trivalent graphs.

Number of self-avoiding walks of any length from NW to SW corners of a grid or lattice with n rows and 3 columns.

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

Number of paths on square lattice.

Number of nonintersecting (or self-avoiding) rook paths joining opposite corners of 3 X n board.

Number of n-node animals on cubic lattice.

Number of n-node animals on f.c.c. lattice (invert A007199).

Reversion of Jacobi theta_3.

Number of leftist trees with n leaves.

Least number not dividing binomial(2n,n).

Number of partitions into pairs.

Bessel polynomial {y_n}'(-1).

Number of partitions into pairs.

Number of colorings of labeled graphs on n nodes using exactly 3 colors, divided by 48.

Number of colorings of labeled graphs on n nodes using exactly 4 colors, divided by 4!*2^6.

Discriminants of imaginary quadratic fields with class number 3 (negated).

Number of starters in cyclic group of order 2n+1.

Number of inequivalent strong starters in cyclic group of order 2n+1.

Number of aperiodic binary necklaces of length n with no subsequence 00, excluding the necklace "0".

Generalized Fibonacci numbers A_{n,2}.

Generalized Fibonacci numbers A_{n,3}.

Generalized Fibonacci numbers A_{n,4}.