Sequences

Number of compositions of n into positive triangular numbers.

a(n+1) = a(n) converted to base 5 from base 2 (written in base 10).

a(n+1) = a(n) converted to base 6 from base 2 (written in base 10).

a(n+1) = a(n) converted to base 7 from base 2 (written in base 10).

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

a(n+1) = a(n) converted to base 9 from base 2 (written in base 10).

a(n+1) = a(n) converted to base 4 from base 3 (written in base 10).

a(n+1) = a(n) converted to base 5 from base 3 (written in base 10).

a(n+1) = a(n) converted to base 6 from base 3 (written in base 10).

a(n+1) = a(n) converted to base 7 from base 3 (written in base 10).

a(n+1) = a(n) converted to base 8 from base 3 (written in base 10).

a(1) = 3; for n>=1, a(n+1) = a(n) converted to base 10 from base 3 (written in base 10).

a(n+1) = a(n) converted to base 5 from base 4 (written in base 10).

a(n+1) = a(n) converted to base 6 from base 4 (written in base 10).

a(n+1) = a(n) converted to base 7 from base 4 (written in base 10).

a(n+1) = a(n) converted to base 8 from base 4 (written in base 10).

a(n+1) = a(n) converted to base 9 from base 4 (written in base 10).

a(n+1) = a(n) converted to base 10 from base 4 (written in base 10); a(1)=4.

a(n+1) = a(n) converted to base 6 from base 5 (written in base 10).

a(n+1) = a(n) converted to base 7 from base 5 (written in base 10).

a(n+1) = a(n) converted to base 8 from base 5 (written in base 10).

a(n+1) = a(n) converted to base 9 from base 5 (written in base 10).

a(n+1) = a(n) converted to base 10 from base 5 (written in base 10).

a(n+1) = a(n) converted to base 7 from base 6 (written in base 10).

a(n+1) = a(n) converted to base 8 from base 6 (written in base 10).

a(n+1) = a(n) converted to base 9 from base 6 (written in base 10).

a(n+1) = a(n) converted to base 10 from base 6 (written in base 10).

a(n+1) = a(n) converted to base 8 from base 7 (written in base 10).

a(n+1) = a(n) converted to base 9 from base 7 (written in base 10).

a(n+1) = a(n) written in base 7 (read in base 10); a(1) = 7.

a(n+1) = a(n) converted to base 9 from base 8 (written in base 10).

a(n+1) = a(n) converted to base 10 from base 9 (written in base 10).

Maximal number of circles of radius 1 that can be packed in a circle of radius n.

Prime factors of Fermat numbers.

Only Fermat number divisible by A023394(n) is 2^2^a(n) + 1.

If any odd power of 2 ends with k 1's and 2's, they must be the first k terms of this sequence in reverse order.

In base 10, if any power of 2 ends with k 2's and 3's, they must be the first k terms of this sequence in reverse order.

If any power of 2 ends with k 2's and 5's, they must be the first k terms of this sequence in reverse order.

If any power of 2 ends with k 2's and 7's, they must be the first k terms of this sequence in reverse order.

If any power of 2 ends with k 2's and 9's, they must be the first k terms of this sequence in reverse order.

If any even power of 2 ends with k 1's and 4's, they must be the first k terms of this sequence in reverse order.

If any power of 2 ends with k 3's and 4's, they must be the first k terms of this sequence in reverse order.

If any power of 2 ends with k 4's and 5's, they must be the first k terms of this sequence in reverse order.

If any power of 2 ends with k 4's and 7's, they must be the first k terms of this sequence in reverse order.

If any power of 2 ends with k 4's and 9's, they must be the first k terms of this sequence in reverse order.

If any even power of 2 ends with k 1's and 6's, they must be the first k terms of this sequence in reverse order.

If any power of 2 ends with k 3's and 6's, they must be the first k terms of this sequence in reverse order.

If any power of 2 ends with k 5's and 6's, they must be the first k terms of this sequence in reverse order.

If any power of 2 ends with k 6's and 7's, they must be the first k terms of this sequence in reverse order.

In base 10, if any power of 2 ends with k 6's and 9's, they must be the first k terms of this sequence in reverse order.