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

Home

Decomposition of A079000

a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is odd".
A079000(n) = A000000(n) * A000000(n) + A079948(n)
Decomposition of A079000 - 9997 dots.

Decomposition of A079523

Numbers n such that binary representation ends in an odd number of ones.
A079523(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A079523 - 9998 dots.

Decomposition of A079545

Primes of the form x^2 + y^2 + 1 with x,y >= 0.
A079545(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A079545 - 9994 dots.

Decomposition of Proth numbers

Proth numbers: of the form k*2^m + 1 for k odd, m >= 1 and 2^m > k.
A080075(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of Proth numbers - 9997 dots.

Decomposition of A080147

Positions of 4k+1 primes A002144 among all primes A000040.
A080147(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A080147 - 9998 dots.

Decomposition of A080218

Monotonically increasing sequence such that every positive integer n appears if and only if d(n) doesn't (d(n)=number of divisors of n, A000005).
A080218(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A080218 - 9998 dots.

Decomposition of A080257

Numbers having at least two distinct or a total of at least three prime factors.
A080257(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A080257 - 9999 dots.

Decomposition of Deletable primes

Deletable primes: primes such that removing some digit leaves either the empty string or another deletable prime.
A080608(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of Deletable primes - 9996 dots.

Decomposition of A080681

17-smooth numbers: i.e. numbers whose prime divisors are all <= 17.
A080681(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A080681 - 9997 dots.