Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099311
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A099311
%S A099311 0,1,2,1,4,2,6,3,2,4,10,2,12,6,4,3,16,2,18,4,6,10,22,3,4,12,2,6,28,4,30,
%T A099311 3,10,16,6,2,36,18,12,4,40,6,42,10,4,22,46,3,6,4,16,12,52,2,10,6,18,28,
%U A099311 58,4,60,30,6,3,12,10,66,16,22,6,70,5,72,36,4,18,10,12,78,4,2,40,82,6,
               16
%N A099311 Exponent of greatest power of 2 dividing the smallest number having exactly 
               n divisors.
%C A099311 a(n) = A007814(A005179(n)).
%H A099311 David Wasserman, <a href="b099311.txt">Table of n, a(n) for n = 1..2000</
               a>
%Y A099311 Cf. A099312, A099313, A099315.
%Y A099311 Sequence in context: A089929 A131888 A109170 this_sequence A130742 A130107 
               A107130
%Y A099311 Adjacent sequences: A099308 A099309 A099310 this_sequence A099312 A099313 
               A099314
%K A099311 nonn
%O A099311 1,3
%A A099311 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 12 2004

    
page 1

Search completed in 0.001 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 1 13:27 EST 2009. Contains 167806 sequences.


AT&T Labs Research