Sequences

Number of matchings in graph P_{8} X P_{n}.

Number of matchings in graph P_{9} X P_{n}.

Number of matchings in graph P_{10} X P_{n}.

Number of matchings in graph P_{11} X P_{n}.

Number of matchings in graph C_{3} X P_{n}.

Number of matchings in graph C_{4} X P_{n}.

Number of matchings in graph C_{5} X P_{n}.

Number of matchings in graph C_{6} X P_{n}.

Number of matchings in graph C_{7} X P_{n}.

Number of matchings in graph C_{8} X P_{n}.

Number of matchings in graph C_{9} X P_{n}.

Number of matchings in graph C_{10} X P_{n}.

Number of matchings in graph C_{11} X P_{n}.

Number of matchings in graph C_{12} X P_{n}.

Number of matchings in graph C_{13} X P_{n}.

Number of matchings in graph P_{2} X P_{3} X P_{n}.

Number of matchings in graph P_{2} X P_{4} X P_{n}.

Number of matchings in graph P_{2} X P_{5} X P_{n}.

Number of matchings in graph P_{2} X P_{6} X P_{n}.

Number of matchings in graph P_{3} X P_{3} X P_{n}.

Number of matchings in graph P_{3} X P_{4} X P_{n}.

Number of matchings in graph C_{4} X C_{4} X P_{n}.

Number of matchings in graph P_{4} X P_{4} X P_{n}.

Number of matchings in graph P_{5} X P_{5} X P_{n}.

Number of matchings in graph P_{n} X P_{n} X P_{n}.

Cubes of Catalan numbers (A000108).

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

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

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

a(n+1) = n*(a(n) + 1) for n >= 1, a(1) = 1.

Number of irreducible exceptional curves of first kind on del Pezzo surface of degree 9-n.

a(n) = 2*(n^2)!* Product_{k = 1..n-1} k!/(n+k)!.

Expansion of (1 - sqrt((1-2*x)*(1-6*x)))/(2*x*(2-3*x)).

Wiener number of n-hexagonal triangle.

Uniform numbers retired by New York Yankees.

Uniform numbers retired by New York Yankees (in chronological order).

Otto Haxel's guess for magic numbers of nuclear shells.

Honaker primes: primes P(k) such that sum of digits of P(k) equals sum of digits of k.

Numbers k such that sum of digits of k-th prime equals sum of digits of k.

a(n) = A005248(n) - n.

Closest integer to (Pi/4)*n^2.

Number of partitions into Catalan numbers.

3-Knödel numbers or D-numbers: numbers m > 3 such that m | k^(m-2)-k for all k with gcd(k, m) = 1.

In A015922, not in A033553.

Duplicate of A130134.

a(n+1) = 2a(n) - {largest prime < a(n)}.

2n - {largest prime < n}.

a(n) = 2n - {smallest prime > n}.

a(n) = (q - p)/2, where p is the largest prime < n and q is the smallest prime > n.

Primes p such that 4!+p is also prime.