Sequences

3rd column of Inverse Stolarsky array.

Number of unlabeled strongly connected digraphs with n nodes.

Wythoff array read by falling antidiagonals.

Zeckendorf expansion of n: repeatedly subtract the largest Fibonacci number you can until nothing remains. Big-endian concatenation of decimals.

Zeckendorf expansion of n: repeatedly subtract the largest Fibonacci number you can until nothing remains. Little-endian concatenation of decimals.

Triangular array formed from Zeckendorf expansion of integers: repeatedly subtract the largest Fibonacci number you can until nothing remains.

Triangular array read by rows, formed from Zeckendorf expansion of integers: repeatedly subtract the largest Fibonacci number you can until nothing remains. Row n give Z. expansion of n.

20 consecutive primes of the form 4k+3.

Rare numbers: k-r and k+r are both perfect squares, where r is reverse of k and k is non-palindromic.

Fourth column of triangle A035342; related to A045894.

Fifth column of triangle A035342; related to A035330.

Reverse and add (in binary) - written in base 10.

Reverse and add (in base 3).

Reverse and add (in base 4).

24 consecutive primes of form 4k+1.

Reverse and add (in binary).

Harmonic seed numbers.

Euler transform of A027656(n-1).

A convolution triangle of numbers obtained from A034171.

Binomial transform of A003603.

a(n) = A000120(n) + A001221(n) - 1.

a(n) = 2*phi(n) if n composite, or 2*phi(n) - (A000120(n)-1) if n prime, where phi = A000010, Euler's totient function, and a(1) = 1.

Number of numbers up to 10^n with exactly 4 divisors.

Number of partitions of n with equal number of parts congruent to each of 0 and 1 (mod 3).

Number of partitions of n with equal number of parts congruent to each of 0 and 2 (mod 3).

Number of partitions of n with equal number of parts congruent to each of 1 and 2 (mod 3).

Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 1 (mod 3).

Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 2 (mod 3).

Number of partitions of n with equal nonzero number of parts congruent to each of 1 and 2 (mod 3).

Number of partitions of n with equal number of parts congruent to each of 0 and 1 (mod 4).

Number of partitions of n with equal number of parts congruent to each of 0 and 2 (mod 4).

Number of partitions of n with equal number of parts congruent to each of 0 and 3 (mod 4).

Number of partitions of n with equal number of parts congruent to each of 1 and 2 (mod 4).

Number of partitions of n with equal number of parts congruent to each of 1 and 3 (mod 4).

Number of partitions of n with equal number of parts congruent to each of 2 and 3 (mod 4).

Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 1 (mod 4).

Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 2 (mod 4).

Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 3 (mod 4).

Number of partitions of n with equal nonzero number of parts congruent to each of 1 and 2 (mod 4).

Number of partitions of n with equal nonzero number of parts congruent to each of 1 and 3 (mod 4).

Number of partitions of n with equal nonzero number of parts congruent to each of 2 and 3 (mod 4).

Number of partitions of n with equal number of parts congruent to each of 0 and 1 (mod 5).

Number of partitions of n with equal number of parts congruent to each of 0 and 2 (mod 5).

Number of partitions of n with equal number of parts congruent to each of 0 and 3 (mod 5).

Number of partitions of n with equal number of parts congruent to each of 0 and 4 (mod 5).

Number of partitions of n with equal number of parts congruent to each of 1 and 2 (mod 5).

Number of partitions of n with equal number of parts congruent to each of 1 and 3 (mod 5).

Number of partitions of n with equal number of parts congruent to each of 1 and 4 (mod 5).

Number of partitions of n with equal number of parts congruent to each of 2 and 3 (mod 5).

Number of partitions of n with equal number of parts congruent to each of 2 and 4 (mod 5).