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

Home

Decomposition of A025583

3D graph (WebGL) / 2D graph - First 500 terms / Generation of 3D graph
Composite numbers that are not the sum of 2 primes.
A025583(n) = A000000(n) * A000000(n) + A000000(n)
Download CSV of the decomposition of A025583 (9999 lines.)
Decomposition of A025583 - 9999 dots.

Decomposition of A025584

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

Decomposition of A026351

3D graph (WebGL) / 2D graph - First 500 terms / Generation of 3D graph
floor(n*phi) + 1, where phi = (1+sqrt(5))/2.
A026351(n) = A000000(n) * A000000(n) + A014675(n)
Download CSV of the decomposition of A026351 (9999 lines.)
Decomposition of A026351 - 9998 dots.

Decomposition of A026424

3D graph (WebGL) / 2D graph - First 500 terms / Generation of 3D graph
Number of prime divisors (counted with multiplicity) is odd; Liouville function lambda(n) (A008836) is negative.
A026424(n) = A000000(n) * A000000(n) + A000000(n)
Download CSV of the decomposition of A026424 (9999 lines.)
Decomposition of A026424 - 9997 dots.

Decomposition of Odious primes

3D graph (WebGL) / 2D graph - First 500 terms / Generation of 3D graph
Odious primes: primes with odd number of 1's in binary expansion.
A027697(n) = A000000(n) * A000000(n) + A000000(n)
Download CSV of the decomposition of Odious primes (9999 lines.)
Decomposition of Odious primes - 9996 dots.

Decomposition of Evil primes

3D graph (WebGL) / 2D graph - First 500 terms / Generation of 3D graph
Evil primes: primes with even number of 1's in their binary expansion.
A027699(n) = A000000(n) * A000000(n) + A000000(n)
Download CSV of the decomposition of Evil primes (9999 lines.)
Decomposition of Evil primes - 9997 dots.

Decomposition of A027861

3D graph (WebGL) / 2D graph - First 500 terms / Generation of 3D graph
Numbers n such that n^2 + (n+1)^2 is prime.
A027861(n) = A000000(n) * A000000(n) + A000000(n)
Download CSV of the decomposition of A027861 (9999 lines.)
Decomposition of A027861 - 9997 dots.

Decomposition of A028260

3D graph (WebGL) / 2D graph - First 500 terms / Generation of 3D graph
Numbers n such that number of prime divisors of n (counted with multiplicity) is even; Liouville function lambda(n) (A008836) is positive.
A028260(n) = A000000(n) * A000000(n) + A000000(n)
Download CSV of the decomposition of A028260 (9999 lines.)
Decomposition of A028260 - 9996 dots.

Decomposition of Curved numbers

3D graph (WebGL) / 2D graph - First 500 terms / Generation of 3D graph
Curved numbers: numbers that have only curved digits (0, 2, 3, 5, 6, 8, 9).
A028374(n) = A000000(n) * A000000(n) + A000000(n)
Download CSV of the decomposition of Curved numbers (9999 lines.)
Decomposition of Curved numbers - 9992 dots.

Decomposition of Good primes (v2)

3D graph (WebGL) / 2D graph - First 500 terms / Generation of 3D graph
Good primes (version 2): prime(n) such that prime(n)^2 > prime(n-i)*prime(n+i) for all 1 <= i <= n-1.
A028388(n) = A000000(n) * A000000(n) + A000000(n)
Download CSV of the decomposition of Good primes (v2) (9999 lines.)
Decomposition of Good primes (v2) - 9996 dots.