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

Home

Decomposition of A047270

Numbers that are congruent to {3, 5} mod 6.
A047270(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A047270 - 9997 dots.

Decomposition of A047336

Numbers that are congruent to {1, 6} mod 7.
A047336(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A047336 - 9997 dots.

Decomposition of A047522

Numbers that are congruent to {1, 7} mod 8.
A047522(n) = A000000(n) * A000000(n) + A010696(n+1)
Decomposition of A047522 - 9997 dots.

Decomposition of A047791

Numbers n such that n plus digit sum of n (A007953) equals a prime.
A047791(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A047791 - 9997 dots.

Decomposition of A047811

Numbers n >= 4 that are not palindromic in any base b, 2<=b<=n/2.
A047811(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A047811 - 9995 dots.

Decomposition of A047845

(n-1)/2, where n runs through odd nonprimes (A014076).
A047845(n) = A000000(n) * A000000(n) + A196274(n)
Decomposition of A047845 - 9997 dots.

Decomposition of Sqrt(n)-smooth numbers

Sqrt(n)-smooth numbers: if p | n then p^2 <= n when p is prime.
A048098(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of Sqrt(n)-smooth numbers - 9997 dots.

Decomposition of A048103

Numbers not divisible by p^p for any prime p.
A048103(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A048103 - 9996 dots.

Decomposition of A048109

Numbers having equally many squarefree and nonsquarefree divisors; number of unitary divisors of n (A034444) = number of non-unitary divisors of n (A048105).
A048109(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A048109 - 9997 dots.

Decomposition of A048161

Primes p such that q=(p^2+1)/2 is also a prime.
A048161(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A048161 - 9994 dots.