The OEIS is supported by the many generous donors to the OEIS Foundation.


(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A099316 Greatest 3-smooth number dividing the n-th minimal number. 6

%I #12 Sep 03 2019 23:43:41

%S 1,2,4,6,12,16,24,36,48,12,64,24,144,36,192,48,72,576,144,24,36,192,

%T 1024,36,1296,48,72,576,3072,144,4096,144,5184,36,1296,192,216,9216,

%U 288,12288,576,432,3072,576,144,5184,72,1296,36864,36,1296,9216,46656,288

%N Greatest 3-smooth number dividing the n-th minimal number.

%C A minimal number is the smallest number with a given number of divisors, see A007416.

%H David A. Corneth, <a href="/A099316/b099316.txt">Table of n, a(n) for n = 1..20000</a> (first 1000 terms from Amiram Eldar)

%F a(n) = A065331(A007416(n)).

%Y Cf. A007416, A065331, A099315, A003586, A099312, A099314.

%K nonn

%O 1,2

%A _Reinhard Zumkeller_, Oct 12 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 23 07:25 EDT 2024. Contains 373629 sequences. (Running on oeis4.)