Sequences

Number of partitions of n into distinct and pairwise relatively prime parts.

Numerator of n-th power of Hermite constant for dimension n.

Denominator of n-th power of Hermite constant for dimension n.

Maximal self-dual antichains on n points.

Maximal tight voting schemes on n points.

Smallest k such that sigma(n+k) = sigma(k).

Numbers k such that phi(x) = k has exactly 2 solutions.

Numbers k such that phi(x) = k has exactly 3 solutions.

Smallest k such that sigma(x) = k has exactly n solutions.

Numbers n such that sigma(x) = n has no solution.

Numbers k such that sigma(x) = k has a unique solution.

Numbers k such that sigma(x) = k has exactly 2 solutions.

Numbers k such that sigma(x) = k has exactly 3 solutions.

Numbers k such that sigma(k+2) = sigma(k).

Smallest k such that phi(x) = k has exactly n solutions, n>=2.

Number of translation planes of order q, q = prime power.

The almost-natural numbers: write n in base 10 and juxtapose digits.

Numbers k such that the decimal expansion of 2^k contains no 0.

a(n), for n >= 2, is smallest positive integer which is consistent with sequence being monotonically increasing and satisfying a(a(n)) = 2n.

Earliest sequence with a(a(n)) = 4n.

Number of 5th-order maximal independent sets in path graph.

7th-order maximal independent sets in path graph.

Number of strict (-1)st-order maximal independent sets in path graph.

Number of strict first-order maximal independent sets in path graph.

Number of strict 3rd-order maximal independent sets in path graph.

Number of strict 5th-order maximal independent sets in path graph.

Number of strict 7th-order maximal independent sets in path graph.

Number of 3rd-order maximal independent sets in cycle graph.

5th-order maximal independent sets in cycle graph.

7th-order maximal independent sets in cycle graph.

Number of strict (-1)st-order maximal independent sets in cycle graph.

Number of strict first-order maximal independent sets in cycle graph.

Number of strict 3rd-order maximal independent sets in cycle graph.

Number of strict 5th-order maximal independent sets in cycle graph.

Number of strict 7th-order maximal independent sets in cycle graph.

Constant sequence: the all 2's sequence.

Add 2, then reverse digits!.

Add 5, then reverse digits!.

Add 7, then reverse digits.

Add 8, then reverse digits!.

Continued fraction for Sum_{n>=0} 1/2^(2^n) = 0.8164215090218931...

Add n-1 to n-th term of 'n appears n times' sequence (A002024).

No-3-in-line problem for equilateral triangle array of side n.

a(n) = Sum_{m=0..n} (Sum_{k=0..m} binomial(n,k))^3 = (n+2)*2^(3*n-1) - 3*2^(n-2)*n*binomial(2*n,n).

Decimal expansion of Sum_{n>=0} 1/2^(2^n).

Dowling numbers: e.g.f.: exp(x + (exp(b*x) - 1)/b) with b=2.

Wolstenholme numbers: numerator of Sum_{k=1..n} 1/k^2.

a(n) = denominator of Sum_{k=1..n} 1/k^2.

Wolstenholme numbers: numerator of Sum_{k=1..n} 1/k^3.

Denominators of Sum_{k=1..n} 1/k^3.