cp's OEIS Frontend

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.

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

This page as a plain text file.
%I A099313 #20 Sep 13 2024 06:57:30
%S A099313 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 A099313 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 A099313 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 A099313 Exponent of greatest power of 3 dividing the smallest number having exactly n divisors.
%H A099313 Amiram Eldar, <a href="/A099313/b099313.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..2000 from Antti Karttunen computed from the b-file of A005179 provided by _Don Reble_)
%F A099313 a(n) = A007949(A005179(n)).
%t A099313 A005179 = Cases[Import["https://oeis.org/A005179/b005179.txt", "Table"], {_, _}][[All, 2]];
%t A099313 a[n_] := IntegerExponent[A005179[[n]], 3];
%t A099313 Array[a, 2000] (* _Jean-François Alcover_, Dec 10 2021 *)
%Y A099313 Cf. A005179, A007949.
%Y A099313 Cf. A099314, A099311, A099315.
%K A099313 nonn
%O A099313 1,9
%A A099313 _Reinhard Zumkeller_, Oct 12 2004
%E A099313 More terms from _Antti Karttunen_, Oct 05 2017