Decomposition into weight × level + jump - all 2D graphs

Concatenation of two or more consecutive positive integers.

A035333(n) = A000000(n) * A000000(n) + A000000(n)

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

A035336(n) = A000000(n) * A000000(n) + A194584(n)

Happy primes: primes that eventually reach 1 under iteration of "x -> sum of squares of digits of x".

A035497(n) = A000000(n) * A000000(n) + A000000(n)

Numbers n such that BCR(n) = n, where BCR = binary-complement-and-reverse = take one's complement then reverse bit order.

A035928(n) = A000000(n) * A000000(n) + A000000(n)

Numbers n such that sum of even digits of n equals sum of odd digits of n.

A036301(n) = A000000(n) * A000000(n) + A000000(n)

Number of divisors is a digit in the base 10 representation of n.

A036433(n) = A000000(n) * A000000(n) + A000000(n)

a(n+1) = next number having largest prime dividing a(n) as a factor, with a(1) = 2.

A036441(n) = A000000(n) * A000000(n) + A076272(n+1)

Numbers n such that d(d(n)) is an odd prime, where d(k) is the number of divisors of k.

A036455(n) = A000000(n) * A000000(n) + A000000(n)

Numbers n such that number of divisors of n is a power of 2.

A036537(n) = A000000(n) * A000000(n) + A000000(n)

Numbers n such that, in the binary expansion of n, reading from right to left, the number of 1's never exceeds the number of 0's.

A036990(n) = A000000(n) * A000000(n) + A000000(n)