|
%I #14 Dec 10 2021 22:52:59
%S 0,0,0,1,0,1,0,1,2,1,0,1,0,1,2,1,0,2,0,1,2,1,0,2,4,1,2,1,0,2,0,1,2,1,
%T 4,2,0,1,2,1,0,2,0,1,2,1,0,2,6,4,2,1,0,2,4,1,2,1,0,2,0,1,2,3,4,2,0,1,
%U 2,4,0,2,0,1,4,1,6,2,0,3,2,1,0,2,4,1,2,1,0,2,6,1,2,1,4,2,0,6,2,4,0,2,0,1,4
%N Exponent of greatest power of 3 dividing the smallest number having exactly n divisors.
%H Antti Karttunen, <a href="/A099313/b099313.txt">Table of n, a(n) for n = 1..2000</a> (computed from the b-file of A005179 provided by _Don Reble_)
%F a(n) = A007949(A005179(n)).
%t A005179 = Cases[Import["https://oeis.org/A005179/b005179.txt", "Table"], {_, _}][[All, 2]];
%t a[n_] := IntegerExponent[A005179[[n]], 3];
%t Array[a, 2000] (* _Jean-François Alcover_, Dec 10 2021 *)
%Y Cf. A005179, A007949.
%Y Cf. A099314, A099311, A099315.
%K nonn
%O 1,9
%A _Reinhard Zumkeller_, Oct 12 2004
%E More terms from _Antti Karttunen_, Oct 05 2017
|
