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

Home

Decomposition of A004780

Binary expansion contains 2 adjacent 1's.
A004780(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A004780 - 9997 dots.

Decomposition of A005098

Numbers n such that 4n + 1 is prime.
A005098(n) = A000000(n) * A000000(n) + A082074(n)
Decomposition of A005098 - 9997 dots.

Decomposition of Deficient numbers

Deficient numbers: numbers n such that sigma(n) < 2n.
A005100(n) = A000000(n) * A000000(n) + A125238(n)
Decomposition of Deficient numbers - 9997 dots.

Decomposition of Abundant numbers

Abundant numbers (sum of divisors of n exceeds 2n).
A005101(n) = A000000(n) * A000000(n) + A125115(n)
Decomposition of Abundant numbers - 9999 dots.

Decomposition of Untouchable numbers

Untouchable numbers: impossible values for sum of aliquot parts of n.
A005114(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of Untouchable numbers - 7997 dots.

Decomposition of Squarefree numbers

Squarefree numbers: numbers that are not divisible by a square greater than 1.
A005117(n) = A184832(n) * A184834(n) + A076259(n)
Decomposition of Squarefree numbers - 9997 dots.

Decomposition of Practical numbers

Practical numbers: positive integers n such that every k <= sigma(n) is a sum of distinct divisors of n. Also called panarithmic numbers.
A005153(n) = A000000(n) * A000000(n) + A179651(n)
Decomposition of Practical numbers - 9996 dots.

Decomposition of A005214

Triangular numbers together with squares (excluding 0).
A005214(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A005214 - 9995 dots.

Decomposition of A005228

Sequence and first differences (A030124) together list all positive numbers exactly once.
A005228(n) = A000000(n) * A000000(n) + A030124(n)
Decomposition of A005228 - 9996 dots.

Decomposition of A005236

Barriers for omega(n): numbers n such that, for all m < n, m + omega(m) <= n.
A005236(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A005236 - 9998 dots.