OFFSET
1,1
MAPLE
A066882 := proc(n) gf := 1 ; for d in numtheory[divisors](n) do if isprime(d) then gf := gf/(1-x^d) ; gf := taylor(gf, x=0, n+2) ; end if; end do: coeftayl(gf, x=0, n) ; end proc:
A168324 := proc(n) if n = 1 then 0; else multn := numtheory[bigomega](n) ; multn := factorial(multn) ; for p in ifactors(n)[2] do multn := multn/factorial(op(2, p)) ; end do: multn ; end if; end proc:
for n from 1 to 300 do if A066882(n) > A168324(n) then printf("%d, \n", n) ; end if; end do: # R. J. Mathar, May 21 2010
CROSSREFS
KEYWORD
nonn
AUTHOR
Juri-Stepan Gerasimov, Nov 23 2009
EXTENSIONS
More terms from R. J. Mathar, May 21 2010
STATUS
approved