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

Home

Decomposition of A063037

3D graph (WebGL) / 2D graph - First 500 terms / Generation of 3D graph
Numbers without 3 consecutive equal binary digits.
A063037(n) = A000000(n) * A000000(n) + A000000(n)
Download CSV of the decomposition of A063037 (9999 lines.)
Decomposition of A063037 - 9995 dots.

Decomposition of A063638

3D graph (WebGL) / 2D graph - First 500 terms / Generation of 3D graph
Primes p such that p-2 is a semiprime.
A063638(n) = A000000(n) * A000000(n) + A000000(n)
Download CSV of the decomposition of A063638 (9999 lines.)
Decomposition of A063638 - 9997 dots.

Decomposition of A063825

3D graph (WebGL) / 2D graph - First 500 terms / Generation of 3D graph
(n-3, n-5, n-17, n-257, n-65537) are all primes.
A063825(n) = A000000(n) * A000000(n) + A000000(n)
Download CSV of the decomposition of A063825 (9999 lines.)
Decomposition of A063825 - 9999 dots.

Decomposition of Unitary untouchable numbers

3D graph (WebGL) / 2D graph - First 500 terms / Generation of 3D graph
Unitary untouchable numbers: us(x) = n has no solution where us(x) (A063919) is the sum of the proper unitary divisors of x.
A063948(n) = A000000(n) * A000000(n) + A000000(n)
Download CSV of the decomposition of Unitary untouchable numbers (9999 lines.)
Decomposition of Unitary untouchable numbers - 9995 dots.

Decomposition of Pillai primes

3D graph (WebGL) / 2D graph - First 500 terms / Generation of 3D graph
Pillai primes: p such that there exists an integer m such that m!+1 is 0 mod p and p is not 1 mod m.
A063980(n) = A000000(n) * A000000(n) + A000000(n)
Download CSV of the decomposition of Pillai primes (9999 lines.)
Decomposition of Pillai primes - 9998 dots.

Decomposition of Unusual numbers

3D graph (WebGL) / 2D graph - First 500 terms / Generation of 3D graph
Not sqrt(n)-smooth: some prime factor of n is > sqrt(n).
A064052(n) = A000000(n) * A000000(n) + A000000(n)
Download CSV of the decomposition of Unusual numbers (10000 lines.)
Decomposition of Unusual numbers - 9998 dots.

Decomposition of A064150

3D graph (WebGL) / 2D graph - First 500 terms / Generation of 3D graph
Numbers divisible by the sum of their ternary digits.
A064150(n) = A000000(n) * A000000(n) + A000000(n)
Download CSV of the decomposition of A064150 (9999 lines.)
Decomposition of A064150 - 9996 dots.

Decomposition of A064194

3D graph (WebGL) / 2D graph - First 500 terms / Generation of 3D graph
a(2n) = 3*a(n), a(2n+1) = 2*a(n+1)+a(n), with a(1) = 1.
A064194(n) = A000000(n) * A000000(n) + A000000(n)
Download CSV of the decomposition of A064194 (9999 lines.)
Decomposition of A064194 - 9995 dots.

Decomposition of A064437

3D graph (WebGL) / 2D graph - First 500 terms / Generation of 3D graph
a(1)=1, a(n)=a(n-1)+3 if n is already in the sequence, a(n)=a(n-1)+2 otherwise.
A064437(n) = A000000(n) * A000000(n) + A000000(n)
Download CSV of the decomposition of A064437 (9999 lines.)
Decomposition of A064437 - 9997 dots.

Decomposition of A064700

3D graph (WebGL) / 2D graph - First 500 terms / Generation of 3D graph
Numbers n that are divisible by the multiplicative digital root of n.
A064700(n) = A000000(n) * A000000(n) + A000000(n)
Download CSV of the decomposition of A064700 (9999 lines.)
Decomposition of A064700 - 9996 dots.