Sequences

Triangle read by rows: matrix cube of the Stirling2 triangle A008277.

Triangle read by rows: matrix 4th power of the Stirling2 triangle A008277.

Matrix 5th power of Stirling2 triangle A008277.

Matrix square of Stirling-1 triangle A008275.

Triangle read by rows: matrix cube of the Stirling-1 triangle A008275.

Triangle read by rows: matrix 4th power of the Stirling-1 triangle A008275.

Triangle read by rows: matrix 5th power of the Stirling-1 triangle A008275.

Erroneous version of A158124.

Number of divisors of n-th refactorable number (A033950(n)).

Numbers whose square contains the same digit more than 2/3 of the time and does not end in 0.

Numerators in Stirling expansion of middle binomial coefficient.

Number of different coefficient values in expansion of Product_{i=1..n} (1+q^i).

a(n) = ceiling( (n^2 + n + 2)/4 ).

Number of different coefficient values in expansion of Product (1+q^1+q^3...+q^(2i-1)), i=1 to n.

a(n) = floor((n^2 + n + 8) / 4).

Largest coefficient in expansion of Product_{i=1..n} (1 + q^i + q^(2i)).

Number of different coefficient values in expansion of Product (1+q^i+q^(2i)), i=1 to n.

Largest coefficient in expansion of Product_{i=1..n} (1 + (-q)^i).

Number of different coefficient values in expansion of Product_{i=1..n} (1 + (-q)^i).

Number of different coefficient values in expansion of Product_{i=1..n} (1-q^1+q^2-...+(-q)^i).

Largest coefficient in expansion of Product (1+q^1+q^3...+q^(2i-1)), i=1 to n.

Numbers k such that k and k+1 both have 4 divisors.

Smallest of three consecutive squarefree numbers k, k+1, k+2 of the form p*q where p and q are distinct primes.

a(n+2) = -a(n+1) + a(n) (signed Fibonacci numbers) with a(-2) = a(-1) = 1; or Fibonacci numbers (A000045) extended to negative indices.

Indices of triangular numbers which are also heptagonal.

Maximal number m of integers s(i), with 1 <= s(1) < s(2) < ... < s(m) <= n, such that all sums s(i) + s(j), i<>j, are distinct.

Number of partitions satisfying cn(0,5) <= cn(1,5) and cn(0,5) <= cn(4,5).

Number of partitions satisfying cn(0,5) <= cn(2,5) and cn(0,5) <= cn(3,5).

Number of partitions satisfying cn(0,5) <= cn(1,5) + cn(4,5).

Number of partitions satisfying cn(0,5) <= cn(2,5) + cn(3,5).

Number of partitions satisfying cn(0,5) < cn(2,5) + cn(3,5).

Number of partitions satisfying cn(0,5) < cn(1,5) + cn(4,5).

Number of partitions satisfying cn(0,5) <= cn(1,5) + cn(2,5) and cn(0,5) <= cn(4,5) + cn(2,5) and cn(0,5) <= cn(1,5) + cn(3,5) and cn(0,5) <= cn(4,5) + cn(3,5).

Number of partitions satisfying cn(0,5) <= cn(1,5) + cn(4,5) + cn(2,5) and cn(0,5) <= cn(1,5) + cn(4,5) + cn(3,5).

Number of partitions satisfying cn(0,5) <= cn(1,5) + cn(2,5) + cn(3,5) and cn(0,5) <= cn(4,5) + cn(2,5) + cn(3,5).

Number of partitions satisfying cn(0,5) < cn(1,5) + cn(4,5) + cn(2,5) and cn(0,5) < cn(1,5) + cn(4,5) + cn(3,5).

Number of partitions satisfying cn(0,5) < cn(1,5) + cn(2,5) + cn(3,5) and cn(0,5) < cn(4,5) + cn(2,5) + cn(3,5).

Number of partitions satisfying cn(0,5) < cn(1,5) + cn(4,5) + cn(2,5) + cn(3,5).

Number of partitions satisfying cn(0,5) <= cn(1,5) + cn(4,5) + cn(2,5) + cn(3,5).

Number of partitions satisfying cn(0,5) + cn(1,5) <= 1 and cn(0,5) + cn(4,5) <= 1.

Number of partitions satisfying cn(0,5) + cn(2,5) <= 1 and cn(0,5) + cn(3,5) <= 1.

Number of partitions satisfying cn(0,5) + cn(1,5) + cn(4,5) <= 1.

Number of partitions satisfying cn(0,5) + cn(2,5) + cn(3,5) <= 1.

Number of partitions satisfying cn(1,5) <= 1 and cn(4,5) <= 1.

Number of partitions satisfying cn(2,5) <= 1 and cn(3,5) <= 1.

Number of partitions satisfying cn(1,5) + cn(4,5) <= 1.

Number of partitions satisfying cn(2,5) + cn(3,5) <= 1.

Number of partitions satisfying cn(0,5) = cn(1,5) + cn(4,5).

Number of partitions satisfying cn(0,5) = cn(2,5) + cn(3,5).

Number of partitions satisfying cn(1,5) + cn(4,5) <= cn(0,5).