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

Fouvry-Iwaniec primes: Primes of the form k^2 + p^2 where p is a prime.

A185086(n) = A000000(n) * A000000(n) + A000000(n)

Numbers n whose base-b digit sum is not b for all bases b >= 2.

A187813(n) = A000000(n) * A000000(n) + A000000(n)

Increasing sequence generated by these rules: a(1)=1, and if x is in a then 2x-1 and 3x-1 are in a.

A190803(n) = A000000(n) * A000000(n) + A000000(n)

Least odd prime p>n^2 with (n/p) = 1, where (-) is the Legendre symbol

A190898(n) = A000000(n) * A000000(n) + A000000(n)

Increasing sequence generated by these rules: a(1)=1, and if x is in a then 3x-2 and 4x-2 are in a.

A191113(n) = A000000(n) * A000000(n) + A000000(n)

Nonludic numbers: complement of A003309.

A192607(n) = A000000(n) * A000000(n) + A000000(n)

Numbers n such that (number of integer factors of n counted with multiplicity) less (number of distinct integer factors of n) = 10.

A195069(n) = A000000(n) * A000000(n) + A000000(n)

Numbers n such that (number of prime factors of n counted with multiplicity) less (number of distinct prime factors of n) = 2.

A195086(n) = A000000(n) * A000000(n) + A000000(n)

Numbers n such that (number of prime factors of n counted with multiplicity) less (number of distinct prime factors of n) = 3.

A195087(n) = A000000(n) * A000000(n) + A000000(n)

3-gap primes: Prime p is a term iff there is no prime between 3*p and 3*q, where q is the next prime after p.

A195270(n) = A000000(n) * A000000(n) + A000000(n)