%I A102298
%S A102298 2,2,2,4,2,2,2,2,3,3,2,2,2,4,2,4,3,2,2,3,2,3,2,4,2,2,3,6,2,3,2,3,3,3,2,
%T A102298 3,4,2,2,2,2,4,2,3,2,2,2,6,3,4,3,2,2,5,2,3,3,2,2,5,2,2,2,3,3,4,2,3,2,2,
%U A102298 4,4,2,2,2,6,2,2,3,3,3,3,2,4,2,6,2,5,3,2,2,3,3,3,3,5,2,2,2,4,2,3,2,3,4
%N A102298 Number of prime divisors with multiplicity of n+1 where n and n+1 are 
               composite or twin composite numbers.
%e A102298 For n=8 n+1 = 9 = 3*3 or 2 prime divisors with multiplicity.
%o A102298 (PARI) f(n) = for(x=1,n,y=composite(x)+1;if(!isprime(y),print1(bigomega(y)",
               "))) composite(n) =\The n-th composite number. 1 is def as not prime 
               nor composite. { local(c,x); c=1; x=1; while(c <= n, x++; if(!isprime(x),
               c++); ); return(x) }
%Y A102298 Sequence in context: A138260 A027387 A111735 this_sequence A049298 A075016 
               A102445
%Y A102298 Adjacent sequences: A102295 A102296 A102297 this_sequence A102299 A102300 
               A102301
%K A102298 easy,nonn
%O A102298 1,1
%A A102298 Cino Hilliard (hillcino368(AT)gmail.com), Feb 19 2005