|
%I #10 Nov 05 2019 06:52:01
%S 0,1,2,2,4,3,6,3,4,5,10,4,12,7,6,5,16,5,18,6,8,11,22,5,8,13,6,8,28,7,
%T 30,6,12,17,10,6,36,19,14,7,40,9,42,12,8,23,46,6,12,9,18,14,52,7,14,9,
%U 20,29,58,8,60,31,10,7,16,13,66,18,24,11,70,7,72,37,10,20,16,15,78,8,8,41
%N Number of prime factors (counted with multiplicity) of the smallest odd number with exactly n divisors.
%C a(p) = p-1 for prime p.
%C This sequence first differs from A059975(n) at n=16, because 3^3.5.7 is less than 3.5.7.11. - _Hugo van der Sanden_, May 21 2010
%H Amiram Eldar, <a href="/A122811/b122811.txt">Table of n, a(n) for n = 1..2000</a> (calculated from the b-file at A038547)
%F a(n) = Omega(A038547(n)), where Omega(n) = A001222(n).
%Y Cf. A001222, A038547, A122376, A059975.
%K nonn
%O 1,3
%A _Ray Chandler_, Sep 22 2006
|
