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

Home

Decomposition of A091067

Numbers a(n) such that odd part of a(n) is of form 4k+3.
A091067(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A091067 - 9997 dots.

Decomposition of A091072

Numbers a(n) such that odd part of a(n) is of form 4k+1. The bit to the left of least significant bit of a(n) is unset.
A091072(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A091072 - 9996 dots.

Decomposition of Primitive abundant numbers

Primitive abundant numbers: abundant numbers (A005101) having no abundant proper divisor.
A091191(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of Primitive abundant numbers - 9997 dots.

Decomposition of A091301

Primes of the form p*q + p - q, where p and q are primes.
A091301(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A091301 - 9997 dots.

Decomposition of A091998

Numbers that are congruent to {1, 11} mod 12.
A091998(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A091998 - 9997 dots.

Decomposition of A092192

Semiprimes that are the sum of two successive semiprimes.
A092192(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A092192 - 9997 dots.

Decomposition of A092207

Numbers n such that n and n+2 are semiprimes.
A092207(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A092207 - 9997 dots.