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

Odd primes for which 2 is not a primitive root.

A216838(n) = A000000(n) * A000000(n) + A000000(n)

Numbers n such that phi(n) = phi(n+12), with Euler's totient function phi = A000010.

A217139(n) = A000000(n) * A000000(n) + A000000(n)

Primes that remain prime when the leftmost digit is removed.

A227916(n) = A000000(n) * A000000(n) + A000000(n)

Semiprimes generated by the Euler polynomial x^2 + x + 41.

A228183(n) = A000000(n) * A000000(n) + A000000(n)

Nonnegative numbers n such that n plus a perfect square is a triangular number.

A230044(n) = A000000(n) * A000000(n) + A000000(n)

Numbers of the form k + wt(k) for exactly two distinct k, where wt(k) = A000120(k) is the binary weight of k.

A230091(n) = A000000(n) * A000000(n) + A000000(n)

Numbers of the form k + wt(k) for exactly three distinct k, where wt(k) = A000120(k) is the binary weight of k.

A230092(n) = A000000(n) * A000000(n) + A000000(n)

Primes p such that 3*p-4, 3*p-10, and 3*p-14 are all prime.

A230223(n) = A000000(n) * A000000(n) + A000000(n)

Positive integers that have exactly 6 odd divisors.

A230577(n) = A000000(n) * A000000(n) + A000000(n)

Numbers n such that m + (sum of digits in base-4 representation of m) = n has exactly one solution.

A230633(n) = A000000(n) * A000000(n) + A000000(n)