Sequences

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = (primes).

a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = floor(n/2), s = (odd natural numbers).

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = A000201 (lower Wythoff sequence).

s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = A001950 (upper Wythoff sequence).

a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = A005408 (odd natural numbers), t = A023533.

s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = A014306.

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = (primes).

a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = A000201 (lower Wythoff sequence).

s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A000201 (lower Wythoff sequence), t = A001950 (upper Wythoff sequence).

a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = A000201 (lower Wythoff sequence), t = A023533.

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A000201 (lower Wythoff sequence), t = A014306.

s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = A001950 (upper Wythoff sequence).

a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = A001950 (upper Wythoff sequence), t = A023533.

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A001950 (upper Wythoff sequence), t = A014306.

a(n) = s(1)*s(n) + s(2)*s(n-1) + ... + s(k)*s(n-k+1), where k = floor(n/2), s = A023533.

a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = A023533, t = A014306.

a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = A023533, t = A000040 (primes).

a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = A014306.

a(n) = p(1)p(n) + p(2)p(n-1) + ... + p(k)p(n-k+1), where k = [ n/2 ], p = A000040, the primes.

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

3rd elementary symmetric function of C(n,0), C(n,1), ..., C(n,n).

a(n) = (1/2)*(3rd elementary symmetric function of C(n,0), C(n,1), ..., C(n,n)).

4th elementary symmetric function of C(n,0), C(n,1), ..., C(n,n).

a(n) = n-th elementary symmetric function of C(n,0), C(n,1), ..., C(n,n).

(n-1)st elementary symmetric function of binomial(n,0), binomial(n,1), ..., binomial(n,n).

a(n) = 2nd elementary symmetric function of C(n,0), C(n,1), ..., C(n,[ n/2 ]).

a(n) = 3rd elementary symmetric function of C(n,0), C(n,1), ..., C(n,[ n/2 ]).

a(n) = (1/2)*(3rd elementary symmetric function of C(n,0), C(n,1), ..., C(n,[ n/2 ])).

4th elementary symmetric function of C(n,0), C(n,1), ..., C(n,[ n/2 ]).

a(n) = floor(n/2)-th elementary symmetric function of C(n,0), C(n,1), ..., C(n, floor(n/2)).

a(n) = (k-1)st elementary symmetric function of C(n,0), C(n,1), ..., C(n,k), where k = floor( n/2 ).

Fixed point of the square runlength transform, with a(1) = 1 (the runlength transform of a binary sequence is the sequence of the lengths of its runs).

Unique sequence a of 1's and 2's such that a(1) = 2 and r(r(a)) = a != r(a), where for any sequence s, r(s) is the sequence of lengths of runs of same symbols in s; r(a) is sequence A025142.

Numbers k such that (#1's in s(1),...,s(k)) = (#1's in r(1),...,r(k)), where s = A025142 and r = A025143.

Numbers k such that (#1's in s(1),...,s(k)) = -1 + (#1's in r(1),...,r(k)), where s = A025142 and r = A025143.

(#1's in s(1),...,s(n)) - (#1's in r(1),...,r(n)), where s = A025142 and r = A025143.

Number of partitions of n into distinct parts >= 2.

Number of partitions of n into distinct parts >= 3.

Number of partitions of n into distinct parts >= 4.

Number of partitions of n into distinct parts >= 5.

Number of partitions of n into distinct parts >= 6.

Number of partitions of n into distinct parts >= 7.

Number of partitions of n into distinct parts >= 8.

Number of partitions of n into distinct parts >= 9.

Number of partitions of n into distinct parts >= 10.

A prime number of consecutive composites follow n.

Number of partitions of n with distinct parts p(i) such that if i != j, then |p(i) - p(j)| >= 3.

Number of partitions of n with distinct parts p(i) such that if i != j, then |p(i) - p(j)| >= 4.

Number of partitions of n with distinct parts p(i) such that if i != j, then |p(i) - p(j)| >= 5.

Number of partitions of n with distinct parts p(i) such that if i != j, then |p(i) - p(j)| >= 6.