Sequences

Number of binary codes (not necessarily linear) of length n with 16 words.

Number of binary codes (not necessarily linear) of length n with 17 words.

Number of binary codes (not necessarily linear) of length n with 18 words.

Number of ternary codes of length 2 with n words.

Number of ternary codes of length 3 with n words.

Number of ternary codes of length 4 with n words.

Number of ternary codes of length 5 with n words.

Number of ternary codes of length 6 with n words.

Number of ternary codes of length 7 with n words.

Number of ternary codes of length 8 with n words.

Number of ternary codes of length 9 with n words.

Number of ternary codes of length 10 with n words.

Number of ternary codes (not necessarily linear) of length n with 3 words.

Number of ternary codes (not necessarily linear) of length n with 4 words.

Number of ternary codes (not necessarily linear) of length n with 5 words.

Number of ternary codes (not necessarily linear) of length n with 6 words.

Number of ternary codes (not necessarily linear) of length n with 7 words.

Number of ternary codes (not necessarily linear) of length n with 8 words.

Number of ternary codes (not necessarily linear) of length n with 9 words.

Number of ternary codes (not necessarily linear) of length n with 10 words.

Number of ternary codes (not necessarily linear) of length n with 11 words.

Number of ternary codes (not necessarily linear) of length n with 12 words.

Number of quaternary codes of length 2 with n words.

Number of quaternary codes of length 3 with n words.

Number of quaternary codes of length 4 with n words.

Number of quaternary codes of length 5 with n words.

Number of quaternary codes of length 6 with n words.

Number of quaternary codes of length 7 with n words.

Number of quaternary codes of length 8 with n words.

Number of quaternary codes of length 9 with n words.

Number of quaternary codes (not necessarily linear) of length n with 4 words.

Number of quaternary codes (not necessarily linear) of length n with 5 words.

Number of quaternary codes (not necessarily linear) of length n with 6 words.

Number of quaternary codes (not necessarily linear) of length n with 7 words.

Number of quaternary codes (not necessarily linear) of length n with 8 words.

Number of quaternary codes (not necessarily linear) of length n with 9 words.

Number of quaternary codes (not necessarily linear) of length n with 10 words.

Number of quaternary codes (not necessarily linear) of length n with 11 words.

Number of quaternary codes (not necessarily linear) of length n with 12 words.

Number of quaternary codes (not necessarily linear) of length n with 13 words.

Number of quaternary codes (not necessarily linear) of length n with 14 words.

Number of quaternary codes (not necessarily linear) of length n with 15 words.

Triangle read by rows: T(n,k) = number of inequivalent linear [n,k] binary codes without 0 columns (n >= 1, 1 <= k <= n).

Triangle read by rows giving T(n,k) = number of inequivalent indecomposable linear [ n,k ] binary codes without 0 columns (n >= 2, 1 <= k <= n).

Related to quartic factorial numbers A007696.

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

Maximal discrete supergroups of Gamma_0(n).

Write n! as a product of n numbers, n! = k(1)*k(2)*...*k(n) with k(1) <= k(2) <= ..., in all possible ways; a(n) = max value of k(1).

Smallest m such that A034258(m) >= n.

Largest m such that A034258(m) <= n.