|
%I #3 Oct 01 2013 17:58:22
%S 0,0,2,4,6,8,10,12,15,17,19,21,24,26,28,30,34,36,39,41,44,46,48,50,54,
%T 56,58,61,64,66,69,71,76,78,80,82,86,88,90,92,96,98,101,103,106,109,
%U 111,113,118,120,123,125,128,130,134,136,140,142,144,146,150,152,154,157
%N Sum of omega(n!) and bigomega(n!).
%C omega(x!) = number of primes <= x or Pi(x)
%F omega(x): number of distinct prime divisors of x. bigomega(x): number of prime divisors of x, counted with multiplicity.
%o (PARI) omegafactpbigomegafact(n) = { local(x); for(x=0,n, print1(omega(x!)+bigomega(x!)",") ) }
%K easy,nonn
%O 0,3
%A _Cino Hilliard_, Jan 29 2006
|
