Sequences

Numbers congruent to 1 or 5 mod 6.

Reversion of o.g.f. for Bell numbers (A000110) omitting a(0)=1.

Reversion of g.f. (with constant term omitted) for partition numbers.

Reversion of g.f. for Euler (secant) numbers A000364.

Reversion of o.g.f. for tangent numbers.

Reversion of g.f. (beginning with constant term) for number of trees with n nodes.

Reversion of g.f. for Euler numbers A000111(n-1).

Binomial transform of Catalan numbers.

Pascal's triangle read by rows: C(n,k) = binomial(n,k) = n!/(k!*(n-k)!), 0 <= k <= n.

A grasshopper sequence: closed under n -> 2n+2 and 6n+6.

Number of steps needed for juggler sequence (A094683) started at n to reach 1.

Number of steps needed for modified juggler sequence (A094685) started at n to reach 1.

Number of functors of degree n from free Abelian groups to Abelian groups.

Number of numerical semigroups of genus n; conjecturally also the number of power sum bases for symmetric functions in n variables.

Least number for which Solovay-Strassen primality test on bases < prime(n) fails.

G.f.: Product_{k>0} (1-x^(5k-1))*(1-x^(5k-4))/((1-x^(5k-2))*(1-x^(5k-3))).

Difference between A000294 and the number of solid partitions of n (A000293).

Difference between two partition g.f.s.

Difference between the number of 5-dimensional partitions of n and an approximation derived from binomial(n,4).

Unexplained difference between two partition generating functions.

Difference between the number of 7-dimensional partitions of n and an approximation derived from binomial(n,6).

Fourier coefficients of E_{infinity,4}.

Expansion of 6-dimensional cusp form (eta(q) * eta(q^3))^6 in powers of q.

An upper bound on the biplanar crossing number of the complete graph on n nodes.

Number of spanning trees in the graph K_{n}/e, which results from contracting an edge e in the complete graph K_{n} on n vertices (for n>=2).

MU-numbers: next term is uniquely the product of 2 earlier terms.

Signature sequence of sqrt 2 (arrange the numbers i+j*x (i,j >= 1) in increasing order; the sequence of i's is the signature of x).

Signature sequence of sqrt(3).

Multiplicative encoding of the Eulerian number triangle.

a(n) = n! - n^3.

Numbers whose divisors' harmonic and arithmetic means are both integers.

Number of spanning trees in n X n grid.

Erroneous version of A001353.

Number of homogeneous primitive partition identities with largest part n.

Number of homogeneous primitive partition identities of degree 6 with largest part n.

Number of Havender tableaux of height 2 with n columns.

Order of group generated by perfect shuffles of 2n cards.

Maximal Eulerian numbers of second kind.

Primes for which -10 is a primitive root.

Primes with both 10 and -10 as primitive root.

Where the prime race 4k-1 vs. 4k+1 changes leader.

Where prime race 4m-1 vs. 4m+1 is tied.

Where the prime race 3k-1 vs. 3k+1 changes leader.

Where the prime race among 5k+1, ..., 5k+4 changes leader.

Where the prime race among 7k+1, ..., 7k+6 changes leader.

Incorrect duplicate of A297408.

Apocalyptic powers: 2^a(n) contains 666.

Infinitary perfect numbers.

Infinitary multi-perfect numbers.

Number of partitions of n into pairwise coprime parts that are >= 2.