A099313 Exponent of greatest power of 3 dividing the smallest number having exactly n divisors.

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

Author

Reinhard Zumkeller, Oct 12 2004

Keywords

• nonn

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_)

Crossrefs

Cf. A005179, A007949.

Cf. A099314, A099311, A099315.

Programs

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 *)

Formula

a(n) = A007949(A005179(n)).

Extensions

More terms from Antti Karttunen, Oct 05 2017