Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096932
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A096932
%S A096932 6,12,36,48,192,144,576,3072,1296,12288,9216,196608,5184,786432,36864,
%T A096932 12582912,46656,589824,82944,2359296,805306368,3221225472,331776,
%U A096932 37748736,206158430208,746496,3298534883328,5308416,13194139533312
%N A096932 Smallest number having exactly s divisors, where s is the n-th semiprime 
               (A001358).
%C A096932 A000005(a(n))=A001358(n) and A000005(m)<>A001358(n) for m<a(n);
%C A096932 a(n) = A005179(A001358(n));
%C A096932 a(p*q) = 2^(q-1) * 3^(p-1) for primes p<=q;
%C A096932 a(A000040(i)*A000040(j)) = 2^(A084127(j)-1) * 3^(A084127(i)-1) for i<=j;
%Y A096932 Cf. A061234, A061286, A061299.
%Y A096932 Sequence in context: A167338 A078402 A127845 this_sequence A064476 A038266 
               A117596
%Y A096932 Adjacent sequences: A096929 A096930 A096931 this_sequence A096933 A096934 
               A096935
%K A096932 nonn
%O A096932 1,1
%A A096932 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 15 2004

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research