This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A160810 #7 Feb 18 2019 08:54:37
%S A160810 18,24,30,36,40,42,45,48,50,54,56,60,63,66,70,72,75,78,80,84,88,90,96,
%T A160810 98,99,100,102,104,105,108,110,112,114,117,120,126,130,132,135,136,
%U A160810 138,140,144,147,150,152,153,154,156,160,162,165,168,170,171,174,175,176
%N A160810 Numbers k such that the number of partitions of k into prime divisors of k exceeds the number of distinct transpositions of prime factors of k.
%C A160810 Numbers k such that A066882(k) > A168324(k).
%p A160810 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:
%p A160810 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:
%p A160810 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
%Y A160810 Cf. A066882, A168324.
%K A160810 nonn
%O A160810 1,1
%A A160810 _Juri-Stepan Gerasimov_, Nov 23 2009
%E A160810 More terms from _R. J. Mathar_, May 21 2010