Decomposition of A001751
Primes together with primes multiplied by 2.
Decomposition of A001838
Numbers n such that phi(n+2) = phi(n) + 2.
Decomposition of A001839
The coding-theoretic function A(n,4,3).
Decomposition of Sorting numbers
Sorting numbers: maximal number of comparisons for sorting n elements by binary insertion.
Decomposition of A001857
a(1)=2, a(2)=3; for n >= 3, a(n) is smallest number which is uniquely of the form a(j)+a(k) with 1<=j<k<n.
Decomposition of A001912
Numbers n such that 4*n^2 + 1 is prime.
Decomposition of Full reptend primes
Full reptend primes: primes with primitive root 10.
Decomposition of A001952
A Beatty sequence: a(n) = floor(n*(2 + sqrt(2))).
Decomposition of Evil numbers
Evil numbers: numbers with an even number of 1's in their binary expansion.
Decomposition of Segmented numbers
Segmented numbers, or prime numbers of measurement.