|
%I #12 Mar 24 2014 02:29:11
%S 3,2,2,2,3,2,4,2,2,3,5,2,2,2,2,2,3,3,5,2,3,2,4,2,4,2,2,3,6,2,3,2,2,3,
%T 3,2,5,4,4,2,2,2,4,2,3,2,2,2,3,3,4,3,3,2,3,2,3,3,2,2,5,2,2,2,3,3,7,2,
%U 4,2,2,4,4,2,2,2,6,2,2,3,4,3,3,2,2,2,6,2,3,3,5,2,3,3,3,3,5,2,3,2,4,2,3,2,3
%N Number of prime divisors with multiplicity of n where n and n+1 are composite or twin composite numbers.
%e For n=8 n+1=9 a twin composite pair. 8=2*2*2 or product of 3 prime divisors with multiplicity.
%t Total[Transpose[FactorInteger[#]][[2]]]&/@Transpose[Select[Partition[Complement[Range[250],Prime[Range[PrimePi[250]]]],2,1],#[[2]]-#[[1]]==1&]][[1]] (* _Harvey P. Dale_, Nov 25 2010 *)
%o (PARI) f1(n) = for(x=1,n,y=composite(x);if(!isprime(y+1),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) }
%K easy,nonn
%O 1,1
%A _Cino Hilliard_, Feb 19 2005
|
