Sequences

Number of different sets ("cut sets") of triangles a regular (n+2)-gon can be dissected into; two triangulations of an (n+2)-gon are equal if all numbers of congruent triangles coincide.

Trajectory of 1 under map n->9n+1 if n odd, n->n/2 if n even.

Trajectory of 1 under map n->11n+1 if n odd, n->n/2 if n even.

Trajectory of 1 under map n->13n+1 if n odd, n->n/2 if n even.

Trajectory of 1 under map n->17n+1 if n odd, n->n/2 if n even.

Trajectory of 1 under map n->19n+1 if n odd, n->n/2 if n even.

Trajectory of 1 under map n->21n+1 if n odd, n->n/2 if n even.

Trajectory of 1 under map n->23n+1 if n odd, n->n/2 if n even.

Trajectory of 1 under map n->25n+1 if n odd, n->n/2 if n even.

Trajectory of 1 under map n->27n+1 if n odd, n->n/2 if n even.

Trajectory of 1 under map n->29n+1 if n odd, n->n/2 if n even.

Trajectory of 1 under map n->33n+1 if n odd, n->n/2 if n even.

Trajectory of 1 under map n->35n+1 if n odd, n->n/2 if n even.

Trajectory of 1 under map n->37n+1 if n odd, n->n/2 if n even.

Trajectory of 1 under map n->39n+1 if n odd, n->n/2 if n even.

Trajectory of 1 under map n->41n+1 if n odd, n->n/2 if n even.

Trajectory of 1 under map n->43n+1 if n odd, n->n/2 if n even.

Trajectory of 1 under map n->45n+1 if n odd, n->n/2 if n even.

Trajectory of 1 under map n->47n+1 if n odd, n->n/2 if n even.

Trajectory of 1 under map n->49n+1 if n odd, n->n/2 if n even.

Integers k such that 2^k == 7 (mod k).

Integers n such that 2^n == 11 (mod n).

Integers n such that 2^n == 15 (mod n).

Odd integers n such that 2^n == 16 (mod n).

Number of partitions of n into two or more distinct nonzero squares.

Order of first letter of n-th month of the year.

Numbers that are divisible by at least 4 primes (counted with multiplicity).

Write 0,1,2,... in a clockwise spiral on a square lattice, writing each digit at a separate lattice point, starting with 0 at the origin and 1 at x=0, y=-1; sequence gives the numbers on the positive y-axis.

Write 0,1,2,... in a clockwise spiral on a square lattice, writing each digit at a separate lattice point, starting with 0 at the origin and 1 at x=0, y=-1; sequence gives the numbers on the negative x-axis.

Write 0,1,2,... in a clockwise spiral on a square lattice, writing each digit at a separate lattice point, starting with 0 at the origin and 1 at x=0, y=-1; sequence gives the numbers on the negative y-axis.

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

Numbers that are divisible by exactly three different primes.

Numbers that are divisible by exactly four different primes.

a(n) = n*(n+1)*(5*n+1)/6.

Number of bipartite graphs with n nodes.

8 times triangular numbers: a(n) = 4*n*(n+1).

Numbers k such that the sum of the first k primes is a square.

Numbers n such that the sum of the primes <= n is a square.

a(n) = (-1)^n.

One half of triple factorial numbers.

One third of triple factorial numbers.

A005150 expanded into single digits.

A007890 expanded into single digits.

Successive decimal digits of triangular numbers.

Successive digits of Catalan numbers.

Number of n-step self-avoiding walks on the 4-dimensional hypercubic lattice with no non-contiguous adjacencies.

First differences of A045891.

a(n) = floor(2^|n-1|/2). Or: 1, 0, followed by powers of 2.

Convolution of A000295(n+2) (n>=0) with itself.

Number of 2n-step self avoiding closed walks on square grid, restricted to a quadrant and passing through origin.