Sequences

a(1) = 7; a(n+1) = a(n)-th composite.

Central heptanomial coefficients: largest coefficient of (1+x+...+x^6)^n.

Central octonomial coefficients: largest coefficient of (1+x+...+x^7)^n.

Central "nonomial" coefficient: largest coefficient of (1+x+...+x^8)^n.

Central decanomial coefficients: largest coefficient of (1 + x + ... + x^9)^n.

Final digits of !n = Sum_{i=0..n} i! (A003422) for very large n, read from right.

a(n) = least 2k such that p is the least prime in a Goldbach partition of 2k, where p = prime(n).

Numbers k such that least prime in the Goldbach partition of k increases.

Smallest prime in Goldbach partition of A025018(n).

Numbers whose least quadratic nonresidue (A020649) is 2.

Numbers whose least quadratic nonresidue (A020649) is 3.

Numbers whose least quadratic nonresidue (A020649) is 5.

Numbers whose least quadratic nonresidue (A020649) is 7.

Numbers whose least quadratic nonresidue (A020649) is 11.

Numbers whose least quadratic nonresidue (A020649) is 13.

Numbers whose least quadratic nonresidue (A020649) is 17.

Numbers whose least quadratic nonresidue (A020649) is 19.

Numbers whose least quadratic nonresidue (A020649) is 23.

Numbers whose least quadratic nonresidue (A020649) is 29.

Number of distributive lattices; also number of paths with n turns when light is reflected from 7 glass plates.

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

Numbers with an increasing number of non-residues (moduli).

Increasing number of non-residues (number of non-residues).

Least modulus >= 3 having maximum run of n consecutive non-residues.

Number of partitions of { 1, 2, ..., 3n } into sets of size 3.

Number of partitions of { 1, 2, ..., 4n } into sets of size 4.

Number of partitions of { 1, 2, ..., 5n } into sets of size 5.

Number of partitions of { 1, 2, ..., 6n } into sets of size 6.

Number of partitions of { 1, 2, ..., 7n } into sets of size 7.

Number of partitions of { 1, 2, ..., 8n } into sets of size 8.

Number of partitions of { 1, 2, ..., 9n } into sets of size 9.

Number of partitions of { 1, 2, ..., 10n } into sets of size 10.

a(n) is not of the form prime + a(k), k < n.

a(n) not of form prime - a(k), k < n.

a(n) not of form prime +- a(k), k < n.

a(n) is the least odd prime p such that the maximum run length of consecutive quadratic residues modulo p is n.

Number of alternating compositions, i.e., compositions with alternating increases and decreases, starting with either an increase or a decrease.

Number of up/down (initially ascending) compositions of n.

Number of down/up (initially descending) compositions of n.

Numbers of form j*k + k*i + i*j, where 1 <=i <= j <= k, including repetitions.

Numbers of the form j*k + k*i + i*j, where i,j,k >= 1.

Numbers not of form a*b + b*c + c*a for 1<=a<=b<=c (probably the list is complete).

Positions of primes in sequence A025051 (numbers of form j*k + k*i + i*j, without repetitions, where 1 <=i <= j <= k).

Positions of even numbers in sequence A025051 (numbers of form j*k + k*i + i*j, without repetitions, where 1 <= i <= j <= k).

Positions of odd numbers in sequence A025051 (numbers of form j*k + k*i + i*j, without repetitions, where 1 <= i <= j <= k).

a(n) = position of 3*n^2 in sequence A025051 (numbers of form j*k + k*i + i*j, without repetitions, where 1 <= i <= j <= k).

Position of 3n+2 in A025051 (numbers of form j*k + k*i + i*j, without repetitions, where 1 <= i <= j <= k).

Numbers of form i*j + j*k + k*i, where 1 <=i < j < k, including repetitions.

Numbers expressible in more than one way as j*k + k*i + i*j, where 1 <=i < j < k.

Numbers of the form i*j + j*k + k*i, where 1 <= i < j < k.