Sequences

Odd numbers in the triangle of Eulerian numbers that are not 1.

Triangular array formed from elements to left of middle of Pascal's triangle.

Triangular array formed from elements to left of middle of rows of Pascal's triangle that are not 1.

Inverse of 455th cyclotomic polynomial.

A063691 without zeros.

Dedekind numbers: monotone Boolean functions, or nonempty antichains of subsets of an n-set.

Triangular array formed from elements to right of middle of rows of the triangle of Eulerian numbers.

Triangular array formed from elements to right of middle of rows of the triangle of Eulerian numbers that are greater than 1.

Triangular array formed from odd elements to right of middle of rows of the triangle of Eulerian numbers (A008292).

Triangular array formed from odd elements to right of middle of rows of the triangle of Eulerian numbers that are greater than 1.

Inverse of 462nd cyclotomic polynomial.

Triangular array formed from even elements to right of middle of rows of the triangle of Eulerian numbers.

Pascal's triangle - 1: Triangle read by rows: T(n, k) = A007318(n, k) - 1.

Inverse of 465th cyclotomic polynomial.

Triangular array formed from odd elements to right of middle of rows of Pascal's triangle.

Triangular array formed from even elements to right of middle of rows of Pascal's triangle.

Expansion of (1 + 2*x)/(1 - 2*x)^3.

Inverse of 469th cyclotomic polynomial.

Exponential generating function = (1+2*x)/(1-2*x)^3.

Expansion of g.f. (1+2*x)/(1-2*x)^2.

a(n) = 2^n*n!*(2*n+1).

Inverse of 473rd cyclotomic polynomial.

Expansion of (1+2*x) / (1-2*x)^4.

Expansion of (1+2x)/(1-2x)^4 (E.g.f.).

Inverse of 476th cyclotomic polynomial.

List of totally balanced sequences of 2n binary digits written in base 10. Binary expansion of each term contains n 0's and n 1's and reading from left to right (the most significant to the least significant bit), the number of 0's never exceeds the number of 1's.

Weight distribution of [ 18,9,8 ] self-dual code over GF(4).

Weight distribution of [ 17,9,7 ] code over GF(4).

Positions of involutions (permutations whose square is the identity) in reverse colexicographic order (A055089/A195663).

Inverse of 481st cyclotomic polynomial.

a(n) = gcd(n, 2^n - 1).

Inverse of 483rd cyclotomic polynomial.

Odd triangular numbers.

Even triangular numbers.

Central binomial coefficient - 1.

Theta series of hypothetical extremal 3-modular even 36-dimensional lattice with minimal norm 8 and det = 3^18.

Theta series of hypothetical extremal 3-modular even 48-dimensional lattice with minimal norm 10 and det = 3^24.

Varying radii of inscribed circles within primitive Pythagorean triples as a function of increasing values of hypotenuse.

Number of 1's in binary representation of n-th prime.

Number of graphs with unlabeled (non-isolated) nodes and n labeled edges.

Number of graphs with loops, having unlabeled (non-isolated) nodes and n labeled edges.

Inverse of 493rd cyclotomic polynomial.

Inverse of 494th cyclotomic polynomial.

Inverse of 495th cyclotomic polynomial.

Number of digraphs with unlabeled (non-isolated) nodes and n labeled edges.

Inverse of 497th cyclotomic polynomial.

Number of digraphs with loops, having unlabeled (non-isolated) nodes and n labeled edges.

a(n) = floor( n! / e ).

Truncation of Bernoulli number: floor(|B_2n|) * sign(B_2n).

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