login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096932 Smallest number having exactly s divisors, where s is the n-th semiprime (A001358). 15
6, 12, 36, 48, 192, 144, 576, 3072, 1296, 12288, 9216, 196608, 5184, 786432, 36864, 12582912, 46656, 589824, 82944, 2359296, 805306368, 3221225472, 331776, 37748736, 206158430208, 746496, 3298534883328, 5308416, 13194139533312 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

A000005(a(n))=A001358(n) and A000005(m)<>A001358(n) for m<a(n);

a(n) = A005179(A001358(n));

a(p*q) = 2^(q-1) * 3^(p-1) for primes p<=q;

a(A000040(i)*A000040(j)) = 2^(A084127(j)-1) * 3^(A084127(i)-1) for i<=j;

This is to smallest integer for which the number of divisors is the n-th prime (A061286) as semiprimes (A001358) are to primes (A000040) [Jonathan Vos Post, Feb 3, 2011].

CROSSREFS

Cf. A061234, A061286, A061299.

Sequence in context: A167338 A078402 A127845 * A176681 A064476 A038266

Adjacent sequences:  A096929 A096930 A096931 * A096933 A096934 A096935

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 15 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 01:56 EST 2012. Contains 205860 sequences.