Sequences

Decimal part of a(n)^(1/5) starts with reversal of its integer part: first term of runs.

Decimal part of a(n)^(1/6) starts with reversal of its integer part: first term of runs.

Decimal part of a(n)^(1/7) starts with reversal of its integer part: first term of runs.

Decimal part of a(n)^(1/8) starts with reversal of its integer part: first term of runs.

Decimal part of a(n)^(1/9) starts with reversal of its integer part: first term of runs.

Decimal part of a(n)^(1/10) starts with reversal of its integer part: first term of runs.

Decimal part of a(n)^(1/11) starts with reversal of its integer part: first term of runs.

McKay-Thompson series of class 13A for the Monster group with a(0) = -2.

McKay-Thompson series of class 13A for the Monster group with a(0) = 0.

Coefficients of completely replicable function 50a with a(0) = 1.

Erroneous version of A034320.

McKay-Thompson series of class 71A for Monster.

a(n) = n-th quintic factorial number divided by 2.

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

a(n) is the n-th quintic factorial number divided by 5.

Hours struck by a clock.

Triangle of numbers of connected regular (k X n)-matrix matroids of dimension k.

Triangle read by rows: T(n,k) = number of loopless, regular k X n-matrix matroids of dimension k (or n-matroids of rank k).

Number of matroids: column 3 of A034327.

Number of matroids: column 4 of A034327.

Number of matroids: column 5 of A034327.

Number of matroids: column 6 of A034327.

Number of matroids: column 3 of A034328.

Number of matroids: column 4 of A034328.

Number of matroids: column 5 of A034328.

Number of matroids: column 6 of A034328.

Number of inequivalent binary [ n,3 ] codes of dimension <= 3 without zero columns.

Number of binary [ n,4 ] codes of dimension <= 4 without zero columns.

Number of binary [ n,5 ] codes of dimension <= 5 without zero columns.

Number of binary [ n,6 ] codes of dimension <= 6 without zero columns.

Number of binary [ n,7 ] codes of dimension <= 7 without zero columns.

Number of binary [ n,8 ] codes of dimension <= 8 without zero columns.

Number of inequivalent binary linear codes of length n and any dimension k <= n containing no column of zeros.

Number of binary [ n,3 ] codes without 0 columns.

Number of binary [ n,4 ] codes without 0 columns.

Number of binary [ n,5 ] codes without 0 columns.

Number of binary [ n,6 ] codes without 0 columns.

Number of binary [ n,7 ] codes without 0 columns.

Number of binary [ n,8 ] codes without 0 columns.

Number of indecomposable binary [ n,3 ] codes without 0 columns.

Number of indecomposable binary [ n,4 ] codes without 0 columns.

Number of indecomposable binary [ n,5 ] codes without 0 columns.

Number of indecomposable binary [ n,6 ] codes without 0 columns.

Number of indecomposable binary [ n,7 ] codes without 0 columns.

Number of indecomposable binary [ n,8 ] codes without 0 columns.

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

Number of binary [ n,3 ] codes.

Number of binary [ n,4 ] codes.

Number of binary [ n,5 ] codes.

Number of binary [ n,6 ] codes.