Sequences

a(n) = floor( Gamma(n+1/3) ).

a(n) = floor( Gamma(n+2/3) ).

a(n) = floor( Gamma(n+1/4) ).

a(n) = floor( Gamma(n+3/4) ).

Inverse of 506th cyclotomic polynomial.

Nearest integer to Gamma(n + 1/3).

Nearest integer to Gamma(n+2/3).

Nearest integer to Gamma(n+1/4).

Inverse of 510th cyclotomic polynomial.

Inverse of 511th cyclotomic polynomial.

Nearest integer to Gamma(n+1/2).

Nearest integer to Gamma(n+3/4).

Number of Hamiltonian paths in a 4 X (2n+1) grid starting at the lower left corner and finishing in the upper right corner.

Number of Hamiltonian paths from NW to SW corners in a grid with 2n rows and 4 columns.

Order of shuffle group for deck of 3n cards.

Inverse of 517th cyclotomic polynomial.

Inverse of 518th cyclotomic polynomial.

Neither == 0 (mod 4) nor a power of 3.

Largest convex area that can be tiled with n equilateral triangles whose sides s_k are relatively prime, i.e., gcd(s_1,...,s_n) = 1.

List of sizes of squares occurring in lowest order example of a perfect squared square.

Form array in which n-th row is obtained by expanding (1+x+x^2)^n and taking the 2nd column from the center.

Form array in which n-th row is obtained by expanding (1+x+x^2)^n and taking the 3rd column from the center.

Form array in which n-th row is obtained by expanding (1 + x + x^2)^n and taking the 4th column from the center.

Inverse of 525th cyclotomic polynomial.

Number of B-trees of order 3 with n leaves.

Inverse of 527th cyclotomic polynomial.

Number of books required for n book-lengths of overhang in the harmonic book stacking problem. Sum_{i=1..a(n)} 1/i >= 2n and Sum_{i=1..a(n)-1} 1/i < 2n.

Continued fraction for Catalan's constant 1 - 1/9 + 1/25 - 1/49 + 1/81 - ...

Erroneous version of A003656.

Rectilinear crossing number of complete graph on n nodes.

Inverse of 532nd cyclotomic polynomial.

Inverse of 533rd cyclotomic polynomial.

Toroidal crossing number of complete graph.

Numbers k such that a cube can be divided into k subcubes.

Numbers k such that the k-th Euclid number A006862(k) = 1 + (Product of first k primes) is prime.

Primes in Sylvester's sequence A000058.

n-th Euler (secant, zig) number A000364(n) is prime.

Inverse of 539th cyclotomic polynomial.

Decimal expansion of 1 / M(1,sqrt(2)) (Gauss's constant).

Binary reflected Gray code.

Jacobsthal-Lucas numbers.

Number of solutions to Langford (or Langford-Skolem) problem (up to reversal of the order).

Maximal multiplicative persistence (or length) of any n-digit number.

Erroneous version of A001606.

Inverse of 546th cyclotomic polynomial.

Euler's "Lucky" numbers: n such that m^2-m+n is prime for m=0..n-1.

Multiplicity of K_3 in K_n.

Erroneous version of A000228.

Erroneous version of A001168.

Inverse of 551st cyclotomic polynomial.