%I A118176
%S A118176 1,1,2,3,2,5,2,7,8,8,4,11,5,11,12,15,7,16,8,18,16,17,11,23,23,21,21,25,
%T A118176 14,29,15,29,24,25,26,35,20,27,27,38,24,39,26,40,41,30,29,47,45,45,35,
%U A118176 46,33,49,36,51,37,38,38,59,39,39,57,63,40,60,45,60,44,64,49,69,51,47
%N A118176 a(1) = 1. a(n) = number of earlier terms of the sequence which have a 
               different number of divisors than n.
%C A118176 A118177(n) is the number of divisors of a(n).
%H A118176 M. F. Hasler (Maximilian.Hasler(AT)gmail.com), Nov 06 2006, <a href="b118176.txt">
               Table of n, a(n) for n = 1..100</a>
%H A118176 Leroy Quet, <a href="http://www.prism-of-spirals.net/">Home Page</a> 
               (listed in lieu of email address)
%e A118176 11 has 2 divisors. So a(11) = the number of terms among the first 10 
               terms of the sequence which do not have 2 divisors. Only the four 
               terms a(1) = 1, a(2) = 1, a(9) = 8 and a(10) = 8 each do not have 
               2 divisors. So a(11) = 4.
%p A118176 a:=proc(n)option remember; if n=1 then 1 else nops( subs( numtheory[tau](n)=NULL, 
               [ 'numtheory[tau](a(i))', $i=1..n-1 ] )) fi end; - M. F. Hasler (Maximilian.Hasler(AT)gmail.com), 
               Nov 06 2006
%Y A118176 Cf. A118177.
%Y A118176 Sequence in context: A094757 A095171 A096776 this_sequence A005731 A132962 
               A046145
%Y A118176 Adjacent sequences: A118173 A118174 A118175 this_sequence A118177 A118178 
               A118179
%K A118176 nonn
%O A118176 1,3
%A A118176 Leroy Quet Apr 13 2006
%E A118176 More terms from M. F. Hasler (Maximilian.Hasler(AT)gmail.com), Nov 06 
               2006