A092418 A sieve: starting with the sequence of positive integers, delete every 4th number, then delete every 16th number from the remaining sequence, then delete every 64th number, etc. Sequence gives the remaining numbers.
1, 2, 3, 5, 6, 7, 9, 10, 11, 13, 14, 15, 17, 18, 19, 22, 23, 25, 26, 27, 29, 30, 31, 33, 34, 35, 37, 38, 39, 41, 43, 45, 46, 47, 49, 50, 51, 53, 54, 55, 57, 58, 59, 61, 62, 65, 66, 67, 69, 70, 71, 73, 74, 75, 77, 78, 79, 81, 82, 83, 86, 87, 89, 91, 93, 94, 95, 97, 98, 99, 101, 102
Offset: 1
References
- C. Dumitrescu & V. Seleacu, editors, Some Notions and Questions in Number Theory, Vol. I, Erhus Publ., Glendale, 1994.
- Florentin Smarandache, Properties of Numbers, 1972.
Links
- Amiram Eldar, Table of n, a(n) for n = 1..10000
- C. Dumitrescu & V. Seleacu, editors, Some Notions and Questions in Number Theory, Vol. I, item 31.
Programs
-
MATLAB
A = 1:200; A(4:4:end) = 0; A = A(find(A)); A(16:16:end) = 0; A = A(find(A)); A(64:64:end) = 0; A = A(find(A)) % David Wasserman, Apr 28 2004
Extensions
Edited by David Wasserman, Apr 28 2004
Comments