Sequences

Number of binary [ n,7 ] codes.

Number of binary [ n,8 ] codes.

Triangle of number of linear [ n,k ] ternary codes (n >= 1, k >= 1) without 0 columns.

Triangle of number of indecomposable linear [ n,k ] ternary codes (n >= 1, k >= 1) without 0 columns.

Triangle of number of projective linear [ n,k ] ternary codes (n >= 1, k >= 1) without 0 columns.

Triangle of number of indecomposable projective linear [ n,k ] ternary codes (n >= 1, k >= 1) without 0 columns.

Triangle of number of linear [ n,k ] GF(4) codes (n >= 1, k >= 1) without 0 columns.

Triangle of number of indecomposable linear [ n,k ] GF(4) codes (n >= 1, k >= 1) without 0 columns.

Triangle of number of projective linear [ n,k ] GF(4) codes (n >= 1, k >= 1) without 0 columns.

Triangle of number of indecomposable projective linear [ n,k ] GF(4) codes (n >= 1, k >= 1) without 0 columns.

Triangle of number of linear [ n,k ] GF(5) codes (n >= 1, k >= 1) without 0 columns.

Triangle of number of indecomposable linear [ n,k ] GF(5) codes (n >= 1, k >= 1) without 0 columns.

Triangle of number of projective linear [ n,k ] GF(5) codes (n >= 1, k >= 1) without 0 columns.

Triangle of number of indecomposable projective linear [ n,k ] GF(5) codes (n >= 1, k >= 1) without 0 columns.

Fibonacci numbers with all odd digits (probably finite).

Cubes with all digits even.

Squares that remain a square if a suitably chosen digit is dropped.

Squares and omitting some digit gives another number in this list.

Expansion of 1/(1-x)^2/(1-x^2)/(1-x^3)/(1-x^5)/(1-x^8).

Ratio of totient to Carmichael's lambda function: a(n) = A000010(n) / A002322(n).

Number of labeled cyclic groups with n elements.

Number of labeled Abelian groups of order n.

Number of labeled groups.

Number of two-state cellular automaton rules on a (2n+1)-site neighborhood that conserve the number of 1's.

Expansion of (1-16*x)^(-1/4), related to quartic factorial numbers.

Primorial numbers (second definition): n# = product of primes <= n.

Sum of primes <= n.

Smallest prime containing at least n consecutive identical digits.

Multiplicity of highest weight (or singular) vectors associated with character chi_1 of Monster module.

Multiplicity of highest weight (or singular) vectors associated with character chi_2 of Monster module.

Multiplicity of highest weight (or singular) vectors associated with character chi_3 of Monster module.

Multiplicity of highest weight (or singular) vectors associated with character chi_4 of Monster module.

Multiplicity of highest weight (or singular) vectors associated with character chi_5 of Monster module.

Multiplicity of highest weight (or singular) vectors associated with character chi_6 of Monster module.

Multiplicity of highest weight (or singular) vectors associated with character chi_7 of Monster module.

Multiplicity of highest weight (or singular) vectors associated with character chi_8 of Monster module.

Multiplicity of highest weight (or singular) vectors associated with character chi_9 of Monster module.

Multiplicity of highest weight (or singular) vectors associated with character chi_10 of Monster module.

Multiplicity of highest weight (or singular) vectors associated with character chi_11 of Monster module.

Multiplicity of highest weight (or singular) vectors associated with character chi_12 of Monster module.

Multiplicity of highest weight (or singular) vectors associated with character chi_13 of Monster module.

Multiplicity of highest weight (or singular) vectors associated with character chi_14 of Monster module.

Multiplicity of highest weight (or singular) vectors associated with character chi_15 of Monster module.

Values of C(n,3) which can be written as C(x,3) + C(y,3).

Let f(x) = (Pi - 2*arctan(1/(sqrt(x)*sqrt(x+2))))/(2*sqrt(x)*sqrt(x+2)), take (-1)^n*(n-th derivative from right at x=0) and multiply by A001147(n+1).

Multiplicity of highest weight (or singular) vectors associated with character chi_18 of Monster module.

Multiplicity of highest weight (or singular) vectors associated with character chi_19 of Monster module.

Multiplicity of highest weight (or singular) vectors associated with character chi_20 of Monster module.

Multiplicity of highest weight (or singular) vectors associated with character chi_21 of Monster module.

Multiplicity of highest weight (or singular) vectors associated with character chi_22 of Monster module.