%I #12 Mar 31 2012 14:39:55
%S 1,3,4,6,7,9,12,13,15,17,18,22,23,24,28,29,30,32,33,36,37,38,43,44,47,
%T 49,51,52,55,56,58,59,62,65,66,68,70,72,73,74,78,79,80,84,85,86,88,90,
%U 92,94,96,97,98,104,105,106,108,109,111,116,118,119,121,122,126,129,130
%N Limiting sequence when we start with the positive integers (A000027) and delete in step n >= 1 the term at position n + tau(a(n)), where tau(k) is the number of divisors of k.
%H D. X. Charles, <a href="http://pages.cs.wisc.edu/~cdx/Sieve.pdf">Sieve Methods</a>, July 2000, University of Wisconsin.
%H Rémi Eismann, <a href="http://arXiv.org/abs/0711.0865">Decomposition into weight * level + jump and application to a new classification of primes</a>, arXiv:0711.0865 [math.NT]
%H M. C. Wunderlich, <a href="http://matwbn.icm.edu.pl/ksiazki/aa/aa16/aa1614.pdf"> A general class of sieve generated sequences</a>, Acta Arithmetica XVI,1969, pp.41-56.
%H <a href="/index/Si#sieve">Index entries for sequences generated by sieves</a>
%e First few steps are:
%e 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,...
%e n = 1; delete term at position 1+tau(1) = 1+1 =2: 2;
%e 1,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,...
%e n = 2; delete term at position 2+tau(3) = 1+2 = 3: 5;
%e 1,3,4,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,...
%e n = 3; delete term at position 3+tau(4) = 3+3 = 6: 8;
%e 1,3,4,6,7,9,10,11,12,13,14,15,16,17,18,19,20,...
%e n = 4; delete term at position 4+tau(6) = 4+4 = 8: 11;
%e 1,3,4,6,7,9,10,12,13,14,15,16,17,18,19,20,...
%e n = 5; delete term at position 5+tau(7) = 5+2 = 7: 10;
%e 1,3,4,6,7,9,12,13,14,15,16,17,18,19,20,...
%e n = 6; delete term at position 6+tau(9) = 6+3 = 9: 14;
%e 1,3,4,6,7,9,12,13,15,16,17,18,19,20,...
%Y Cf. A000005 (number of divisors), A000027, A137292, A138899, A138900.
%K easy,nonn
%O 1,2
%A _Ctibor O. Zizka_, Mar 16 2008
%E Edited and extended by _Klaus Brockhaus_, Apr 03 2008
%E Moved references to the Links section _R. J. Mathar_, Oct 23 2009