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

Home

Decomposition of A037386

Every base 3 digit of n is a base 10 digit of n.
A037386(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A037386 - 9994 dots.

Decomposition of A038133

From a subtractive Goldbach conjecture: odd primes that are not cluster primes.
A038133(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A038133 - 9999 dots.

Decomposition of A038528

If n has decimal expansion abc...d, with k digits, let f(n) be obtained by deleting all k's from abc...d, closing up and deleting initial 0's; sequence gives n such that f(f(f(...(n)))) = 0 or empty.
A038528(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A038528 - 9991 dots.

Decomposition of Zeroless primes

Primes not containing digit '0', a.k.a. zeroless primes.
A038618(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of Zeroless primes - 9996 dots.

Decomposition of A038770

Numbers divisible by at least one of their digits.
A038770(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A038770 - 9997 dots.

Decomposition of A038772

Numbers not divisible by any of their digits.
A038772(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A038772 - 9996 dots.

Decomposition of A038873

Primes p such that 2 is a square mod p; or, primes congruent to {1, 2, 7} mod 8.
A038873(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A038873 - 9996 dots.