Decomposition of A056875
Generated by sieving the natural numbers: keep the smallest remaining number k and take out its k-th successor l as well as the l-th successor m of l, the m-th successor of m and so on. Then start again from the next remaining number.
Decomposition of A057165
Addition steps in Recamán's sequence A005132.
Decomposition of A057436
Contains digits 1 through 6 only.
Decomposition of A058369
Numbers n such that n and n^2 have same digit sum.
Decomposition of A058972
For a rational number p/q let f(p/q) = sum of aliquot divisors of p+q divided by number of divisors of p+q; sequence gives numbers n such that, starting at n/1 and iterating f, an integer is eventually reached.
Decomposition of A059269
Numbers n for which the number of divisors, tau(n), is divisible by 3.
Decomposition of A059401
Numbers that contains as proper substrings every maximal prime power dividing them.
Decomposition of A059404
Numbers n such that n/[largest power of squarefree kernel] is larger than 1.
Decomposition of Unsafe primes
Unsafe primes: primes not in A005385.
Decomposition of A059708
Numbers n such that all digits have same parity.