Sequences

Inverse of 602nd cyclotomic polynomial.

Numbers that are the product of exactly three (not necessarily distinct) primes.

Numbers that are products of 4 primes.

Numbers that are products of 5 primes (or 5-almost primes, a generalization of semiprimes).

Erroneous version of A001272.

a(n) = solution to the postage stamp problem with 2 denominations and n stamps.

Antidiagonals of the prime-composite array B(m,n) (see A067681) that are zeros from the first Borve conjecture.

Inverse of 609th cyclotomic polynomial.

Exponential generating function is -f(x) * Integral_{t = 0..x} exp(exp(-t) - 1) dt, where f(x) = exp(1 - x - exp(-x)) is the exponential generating function for A014182.

Inverse of 611th cyclotomic polynomial.

Triangle of numbers arising from analysis of Levine's sequence A011784.

Row sums of A014621.

Sequence arising from analysis of Levine's sequence A011784: essentially a duplicate of A144005.

Inverse of 615th cyclotomic polynomial.

Inverse of 616th cyclotomic polynomial.

Number of intersection points of diagonals of an n-gon in general position, plus number of vertices.

Consider all complete bipartite graphs on 2n nodes and all possible assignment of weights w(i) (for nodes i=1,...,2n); sequence gives maximal number of ways to orient the edges of the graph so that each node i has w(i) edges oriented towards it (for i=1,...,2n).

Number of segments (and sides) created by diagonals of an n-gon in general position.

Number of segments created by diagonals of n-gon.

Distinct elements occurring in triangle of Eulerian numbers (unsorted).

Numbers in order in which they appear in Pascal's triangle.

Odd pentagonal numbers.

Even pentagonal numbers.

a(n) = (2*n+1)*(4*n+1).

a(n) = 2*n*(4*n - 1).

Inverse of 627th cyclotomic polynomial.

Odd heptagonal numbers (A000566).

Inverse of 629th cyclotomic polynomial.

Inverse of 630th cyclotomic polynomial.

Even heptagonal numbers (A000566).

Odd octagonal numbers: (2n+1)*(6n+1).

Even octagonal numbers: a(n) = 4*n*(3*n-1).

Triangular array starting with {1,1}; then i-th term in a row gives number of i's in next row.

Form array starting with {1,1}; then i-th term in a row gives number of i's in next row; sequence is formed from final term in each row.

a(n) = (n-1)^a(1) + (n-2)^a(2) + (n-3)^a(3) + ... + 1^a(n-1).

Inverse of 637th cyclotomic polynomial.

Inverse of 638th cyclotomic polynomial.

Number of partitions of n into its divisors with at least one part of size 1.

Number of partitions of n into its nonprime power divisors with at least one part of size 1.

Number of partitions of n into its divisors that are powers of primes (A000961) with at least one part of size 1.

Number of partitions of n into its nonprime divisors with at least one part of size 1.

Number of partitions of n in its prime divisors with at least one part of size 1.

Inverse of 644th cyclotomic polynomial.

Inverse of 645th cyclotomic polynomial.

Inverse of 646th cyclotomic polynomial.

Numbers of letters in n (in the Norwegian language Bokmål).

Numbers m that divide 2^k + 1 for some nonnegative k.

Inverse of 649th cyclotomic polynomial.

Odd numbers that do not divide 2^k + 1 for any k >= 1.

Inverse of 651st cyclotomic polynomial.