Sequences

First column of the Zorach additive triangle A035312.

Zorach additive triangle, read by rows.

(Largest) diagonal of the Zorach additive triangle A035312.

Fourier coefficients of T_8.

Fourier coefficients of T_{10}.

Sum of the square divisors of n.

Pascal-like triangle associated with A000670.

Right-hand diagonal of A035309.

Number of rooted maps of genus n with one vertex and one face; the maps are considered on orientable surfaces and contain 2n edges.

Right-hand diagonal of odd numbered rows in A035309.

Sum of composite divisors of n that are not primes nor prime powers.

Sum of composite divisors of n that are less than n and are not primes nor prime powers.

Related to deca-factorial numbers A045757.

A convolution triangle of numbers, generalizing Pascal's triangle A007318.

Primes of the form 2^k + k^2 + 1.

Beginning of last prime pattern of length n to appear among positive integers.

Write n in binary, interchange 0's and 1's, convert back to decimal.

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

a(n) = n*(2*n+5)*(2*n+7).

5-fold convolution of A001700(n), n >= 0.

Base-1000 expansion of Pi.

Smallest number not the concatenation of consecutive earlier terms.

Concatenation of two or more consecutive positive integers.

a(n) = smallest number which is not the sum of exactly 1 or a(n-1) earlier terms.

a(n) = smallest number m such that n appears in decimal expansion of 1/m.

a(n) = 2*floor(n*phi) + n - 1, where phi = (1+sqrt(5))/2.

Third column of Wythoff array.

4th column of Wythoff array.

5th column of Wythoff array.

6th column of Wythoff array.

Sum of ordered factorizations over all prime signatures with n factors.

The convolution matrix of the double factorial of odd numbers (A001147).

Triangle of coefficients in expansion of (1 + x + x^2 + x^3 + x^4)^n.

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

Smallest prime > prime(1)*prime(2)*...*prime(n)+1.

Let F(n) = Q(n) - P(n) be the Fortunate numbers (A005235); sequence gives n such that F(n) = prime(n+1).

Triangle of a(n,k) = number of minimal covers of an n-set that cover k points of that set uniquely (n >= 1, k >= 1).

Triangle of a(n,k) = number of k-member minimal covers of an n-set (n >= k >= 1).

"DIK" (bracelet, indistinct, unlabeled) transform of A000237.

"BIK" (reversible, indistinct, unlabeled) transform of A000237.

Number of labeled rooted polygonal cacti with bridges (mixed Husimi trees) with n nodes.

Number of increasing rooted polygonal cacti with bridges (mixed Husimi trees) with n nodes.

Number of asymmetric rooted polygonal cacti with bridges (mixed Husimi trees).

"DHK" (bracelet, identity, unlabeled) transform of A035353.

"BHK" (reversible, identity, unlabeled) transform of A035353.

Number of asymmetric polygonal cacti with bridges (mixed Husimi trees).

Number of increasing asymmetric rooted polygonal cacti with bridges (mixed Husimi trees).

k such that A035312(k-1) = n or 0 if there is none.

Number of partitions-into-distinct-parts of n (A000009) is a prime.

Number of partitions of n into parts 3k or 3k+1.