Sequences

Order of alternating group A_n, or number of even permutations of n letters.

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

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

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

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

a(n) = n!/6.

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

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

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

Generalized Stirling numbers, [n+8,8]_4.

a(n) = n!/24.

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

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

Generalized Stirling numbers, [n+8,8]_5.

Generalized Stirling numbers, [n+9,9]_5.

a(n) = n!/5!.

Weight distribution of [ 64,22,16 ] 2nd-order Reed-Muller code of length 64.

Weight distribution of [64,42,8] 3rd-order Reed-Muller code of length 64.

Expansion of cos x / cos 4x.

List of numbers whose digits contain no loops (version 1).

a(n) = n!/6!.

a(n) is 9 written in base 10-n.

8 in base 10-n.

7 in base 10-n.

6 in base 10-n.

5 in base 10-n.

4 in base 10-n.

Squares written in base 2.

a(n) = n^2 written in base 3.

Squares written in base 4.

Squares written in base 5.

Squares written in base 6.

Numbers whose digits contain no loops (version 2).

Numbers in which every digit contains at least one loop (version 1).

Numbers n such that every digit contains a loop (version 2).

Numbers such that at least one digit contains a loop (version 2). Also called "holey" or "holy" numbers.

At least one digit contains a loop (version 1).

2 together with primes multiplied by 2.

a(n) = 3 * prime(n).

Primes multiplied by 4.

Primes multiplied by 5.

Primes together with primes multiplied by 2.

Expansion of 1/((1+x)*(1-x)^5).

Expansion of 1/((1+x)*(1-x)^6).

Lah numbers: a(n) = n!*binomial(n-1,2)/6.

Lah numbers: a(n) = n! * binomial(n-1, 3)/4!.

a(n) = A059366(n,n-3) = A059366(n,3) for n >= 3, where the triangle A059366 arises from the expansion of a trigonometric integral.

Expansion of an integral: central elements of rows of triangle in A059366.

Number of quasi-alternating permutations of length n.

Number of permutations of [n] with n-3 sequences.