Sequences

Expansion of 1/((1-6x)(1-8x)(1-9x)(1-11x)).

Expansion of 1/((1-6x)(1-8x)(1-9x)(1-12x)).

Expansion of 1/((1-6x)(1-8x)(1-10x)(1-11x)).

Expansion of 1/((1-6x)(1-8x)(1-10x)(1-12x)).

Expansion of 1/((1-6x)(1-8x)(1-11x)(1-12x)).

Expansion of 1/((1-6x)(1-9x)(1-10x)(1-11x)).

Expansion of 1/((1-6x)(1-9x)(1-10x)(1-12x)).

Expansion of 1/((1-6x)(1-9x)(1-11x)(1-12x)).

Expansion of 1/((1 - 6*x)*(1 - 10*x)*(1 - 11*x)*(1 - 12*x)).

Expansion of 1/((1-7x)(1-8x)(1-9x)(1-11x)).

Expansion of 1/((1-7x)(1-8x)(1-9x)(1-12x)).

Expansion of 1/((1-7x)(1-8x)(1-10x)(1-11x)).

Expansion of 1/((1-7x)(1-8x)(1-10x)(1-12x)).

Expansion of 1/((1-7x)(1-8x)(1-11x)(1-12x)).

Expansion of 1/((1-7x)(1-9x)(1-10x)(1-11x)).

Expansion of 1/((1-7x)(1-9x)(1-10x)(1-12x)).

Expansion of 1/((1-7x)(1-9x)(1-11x)(1-12x)).

Expansion of 1/((1-7x)(1-10x)(1-11x)(1-12x)).

Call m Egyptian if we can partition m = x_1+x_2+...+x_k into positive integers x_i such that Sum_{i=1..k} 1/x_i = 1; sequence gives all non-Egyptian numbers.

Bisection of A001353. Indices of square numbers which are also octagonal.

From hexagons in a circle problem.

Continued fraction expansion for log_10(2).

If n = p_1^e_1 * ... * p_k^e_k, p_1 < ... < p_k primes, then a(n) = p_1^e_1, with a(1) = 1.

If n = p_1^e_1 * ... * p_k^e_k, p_1 < ... < p_k primes, then a(n) = n/p_1^e_1, with a(1) = 1.

If n = Product (p_j^k_j), a(n) = numerator of Sum 1/p_j (the denominator of this sum is A007947).

If n = Product (p_j^k_j), a(n) = numerator of Sum 1/p_j^k_j.

Numbers that are not the sum of 2 or more distinct positive squares.

Weight distribution of (64,4096,28) Kerdock code.

Weight distribution of (64, 2^52, 6) Preparata code.

Weight distribution of (256,2^16,120) Kerdock code.

Weight distribution of (256,2^240,6) Preparata code.

Follow n+1 by n. Also (essentially) Molien series of 2-dimensional quaternion group Q_8.

a(n) = 3^(n-1) - 2^n + 1 (essentially Stirling numbers of second kind).

a(n) = 4^(n-1) - 3*3^(n-1) + 3*2^(n-1) - 1 (essentially Stirling numbers of second kind).

a(n) = 5^(n-1) - 4*4^(n-1) + 6*3^(n-1) - 4*2^(n-1) + 1 (essentially Stirling numbers of second kind).

Triangular array a(n,k) = (1/k)*Sum_{i=0..k} (-1)^(k-i)*binomial(k,i)*i^n; n >= 1, 1 <= k <= n, read by rows.

Number of T-frame polyominoes with n cells.

Expansion of exp(exp(exp(x) - 1 - x) - 1).

Molien series for complete weight enumerator of self-dual code over GF(4) containing 1^n.

Sequence arising in multiprocessor page migration.

Sequence arising in multiprocessor page migration.

Sequence arising in multiprocessor page migration.

n mod Fibonacci(n).

Engel expansion of sqrt(2).

Fibonacci(n+3) mod n-th prime.

Fibonacci(n+2) mod n-th prime.

Engel expansion of sqrt(3).

Expansion of 1/((1-2*x)*(1-4*x)(1-8*x)(1-16*x)).

Engel expansion of the golden ratio, (1 + sqrt(5))/2 = 1.61803... .

Numbers with an even number of prime divisors (counted with multiplicity); numbers k such that the Liouville function lambda(k) (A008836) is positive.