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

Numbers n such that m = floor(n/4) is coprime to n and, if nonzero, m is also a term of the sequence.

A250036(n) = A000000(n) * A000000(n) + A000000(n)

Numbers n such that m = floor(n/7) is coprime to n and, if nonzero, m is also a term of the sequence.

A250046(n) = A000000(n) * A000000(n) + A000000(n)

Numbers n such that m = floor(n/7) is not coprime to n and, if nonzero, m is also a term of the sequence.

A250047(n) = A000000(n) * A000000(n) + A000000(n)

Numbers n such that m = floor(n/6) is coprime to n and, if nonzero, m is also a term of the sequence.

A250048(n) = A000000(n) * A000000(n) + A000000(n)

Numbers n such that m = floor(n/6) is not coprime to n and, if nonzero, m is also a term of the sequence.

A250049(n) = A000000(n) * A000000(n) + A000000(n)

Numbers n such that gcd(n!, Fibonacci(n)) is prime.

A250444(n) = A000000(n) * A000000(n) + A000000(n)

Numbers n > 1 for which gpf(n) < lpf(n)^2, where lpf and gpf (smallest and greatest prime factor of n) are given by A020639(n) and A006530(n).

A251726(n) = A000000(n) * A000000(n) + A000000(n)

Semiprimes p*q for which p <= q < p^2.

A251728(n) = A000000(n) * A000000(n) + A000000(n)

Numbers D such that D^2 = A^3 + B^4 + C^5 for some positive integers A, B, C.

A256091(n) = A000000(n) * A000000(n) + A000000(n)

Congrua (possible solutions to the congruum problem): numbers n such that there are integers x, y and z with n = x^2-y^2 = z^2-x^2.

A256418(n) = A000000(n) * A000000(n) + A000000(n)