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

Home

Decomposition of A033203

Primes congruent to {1, 2, 3} mod 8; or primes of form x^2+2*y^2; or primes p such that x^2 = -2 has a solution mod p.
A033203(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A033203 - 9996 dots.

Decomposition of A033948

Numbers that have a primitive root (the multiplicative group modulo n is cyclic).
A033948(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A033948 - 9997 dots.

Decomposition of A033949

Positive integers that do not have a primitive root.
A033949(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A033949 - 9998 dots.

Decomposition of Refactorable numbers

Refactorable numbers: number of divisors of n divides n. Also known as tau numbers.
A033950(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of Refactorable numbers - 9995 dots.

Decomposition of A034017

Numbers that are primitively represented by x^2 + xy + y^2.
A034017(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A034017 - 9995 dots.

Decomposition of A034048

Numbers with multiplicative digital root value 0.
A034048(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A034048 - 9997 dots.