login
A099313
Exponent of greatest power of 3 dividing the smallest number having exactly n divisors.
5
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, 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, 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
OFFSET
1,9
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..2000 from Antti Karttunen computed from the b-file of A005179 provided by Don Reble)
FORMULA
a(n) = A007949(A005179(n)).
MATHEMATICA
A005179 = Cases[Import["https://oeis.org/A005179/b005179.txt", "Table"], {_, _}][[All, 2]];
a[n_] := IntegerExponent[A005179[[n]], 3];
Array[a, 2000] (* Jean-François Alcover, Dec 10 2021 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Oct 12 2004
EXTENSIONS
More terms from Antti Karttunen, Oct 05 2017
STATUS
approved