Sequences

Binomial coefficient C(6n,n-5).

Binomial coefficient C(6n,n-6).

Binomial coefficient C(6n,n-7).

Binomial coefficient C(6n,n-8).

Binomial coefficient C(6n,n-9).

Binomial coefficient C(6n,n-10).

Binomial coefficient C(6n,n-11).

Binomial coefficient C(6n,n-12).

Binomial coefficient C(7n,n).

Binomial coefficient C(7n,n-1).

Binomial coefficient C(7n,n-2).

Binomial coefficient C(7n,n-3).

Binomial coefficient C(7n,n-4).

Binomial coefficient C(7n,n-5).

Binomial coefficient C(7n,n-6).

Binomial coefficient C(7n,n-7).

Binomial coefficient C(7n,n-8).

Binomial coefficient C(7n,n-9).

Binomial coefficient C(7n,n-10).

Binomial coefficient C(7n,n-11).

Binomial coefficient C(7n,n-12).

Binomial coefficient C(8n,n).

Binomial coefficient C(8n, n-1).

Binomial coefficient C(8n,n-2).

Binomial coefficient C(8n,n-3).

Binomial coefficient C(8n,n-4).

Binomial coefficient C(8n,n-5).

Binomial coefficient C(8n,n-6).

Binomial coefficient C(8n,n-7).

a(n) = binomial(8*n, n-8).

Binomial coefficient C(8n,n-9).

Binomial coefficient C(8n,n-10).

Binomial coefficient C(8n,n-11).

Binomial coefficient C(8n,n-12).

Superabundant [or super-abundant] numbers: n such that sigma(n)/n > sigma(m)/m for all m < n, sigma(n) being A000203(n), the sum of the divisors of n.

Ratios of successive terms are 1,1,2,3,3,4,5,5,6,7,7,...

One even number followed by two odd numbers.

a(n) = prime(n) + Fibonacci(n).

a(n) = Fibonacci(n+1) + prime(n).

a(n) = Fibonacci(n+2) + prime(n).

a(n) = 1 + Sum_{k=0..n} 2^k*k!.

Least number of edges in graph containing all trees on n nodes.

Expansion of 1 / Sum_{n=-oo..oo} x^(n^2).

Expansion of 1/theta_3(q)^2 in powers of q.

Expansion of 1 / (Sum_{n=-oo..oo} x^(n^2))^3.

Expansion of 1 / (Sum_{n=-oo..oo} x^(n^2))^4.

Expansion of 1 / (Sum_{n=-oo..oo} x^(n^2))^5.

Expansion of ( Sum_{n = -infinity..infinity} x^(n^2) )^(-6).

Expansion of ( Sum_{n = -infinity..infinity} x^(n^2) )^(-7).

Expansion of ( Sum_{n = -infinity..infinity} x^(n^2) )^(-8).