%I A114708
%S A114708 1,1,1,1,2,0,1,1,2,0,2,0,2,0,1,1,2,0,2,0,2,0,2,0,2,0,2,0,3,1,1,2,1,2,1,
%T A114708 1,2,2,1,1,3,1,2,2,2,1,1,1,0,1,2,1,1,1,1,2,2,1,1,1,1,1,0,2,1,1,1,1,2,1,
%U A114708 2,1,1,2,2,2,3,1,2,1,1,1,2,2,1,2,2,1,1,2,2,2,2,2,2,1,1,1,0,1,3,1,2,3,1
%N A114708 a(n) = A114707(n) - A114707(n-1) = the number of distinct primes dividing 
               n but not A114707(n-1).
%C A114708 First occurrence of k=0..8: 7, 2, 6, 30, 330, 4620, 46410, 570570, ..., 
               . - Robert G. Wilson v, Dec 28 2005
%H A114708 Leroy Quet, <a href="http://www.prism-of-spirals.net/">Home Page</a> 
               (listed in lieu of email address)
%e A114708 A114707(11) = 11. Since 2 and 3 are the 2 distinct primes that divide 
               12 and neither divides 11, a(12) is 2 (and A114707(12) is 2 + A114707(11) 
               = 13).
%t A114708 a[1] = 1; a[n_] := a[n] = a[n - 1] + Length@Complement[First /@ FactorInteger@n, 
               First /@ FactorInteger@a[n - 1]]; b = Array[a, 100]; Drop[b, 1] - 
               Drop[b, -1] (from Robert G. Wilson v (rgwv(at)rgwv.com), Dec 28 2005)
%o A114708 (PARI) {a=1;for(n=2,106,print1(d=#setminus(Set(factor(n)[,1]),Set(factor(a)[,
               1])),",");a=a+d)} (Brockhaus)
%Y A114708 Cf. A114707.
%Y A114708 Sequence in context: A051010 A130027 A116949 this_sequence A084927 A072670 
               A087624
%Y A114708 Adjacent sequences: A114705 A114706 A114707 this_sequence A114709 A114710 
               A114711
%K A114708 nonn
%O A114708 2,5
%A A114708 Leroy Quet, Dec 26 2005
%E A114708 More terms from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de) and 
               Robert G. Wilson v (rgwv(at)rgwv.com), Dec 27 2005