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

Home

Decomposition of A056875

Generated by sieving the natural numbers: keep the smallest remaining number k and take out its k-th successor l as well as the l-th successor m of l, the m-th successor of m and so on. Then start again from the next remaining number.
A056875(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A056875 - 9997 dots.

Decomposition of A057165

Addition steps in Recamán's sequence A005132.
A057165(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A057165 - 9996 dots.

Decomposition of A058369

Numbers n such that n and n^2 have same digit sum.
A058369(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A058369 - 8348 dots.

Decomposition of A058972

For a rational number p/q let f(p/q) = sum of aliquot divisors of p+q divided by number of divisors of p+q; sequence gives numbers n such that, starting at n/1 and iterating f, an integer is eventually reached.
A058972(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A058972 - 9996 dots.

Decomposition of A059269

Numbers n for which the number of divisors, tau(n), is divisible by 3.
A059269(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A059269 - 9997 dots.

Decomposition of A059401

Numbers that contains as proper substrings every maximal prime power dividing them.
A059401(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A059401 - 9996 dots.

Decomposition of A059404

Numbers n such that n/[largest power of squarefree kernel] is larger than 1.
A059404(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A059404 - 9998 dots.

Decomposition of A059708

Numbers n such that all digits have same parity.
A059708(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A059708 - 9996 dots.