Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A140965
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A140965
%S A140965 1,2,6,8,20,12,42,24,36,60,132,60,312,168,120,240,612,180,912,240,420,
%T A140965 660,1380,360,900,1560,1080,840,3480,720,3720,1440,1980,3060,1260,1260,
%U A140965 8880,4560,3120,1680,14760,2520,15480,3960,2520,8280,16920,3360,8820
%N A140965 Smallest multiple of n with a number of divisors >= n.
%C A140965 Also add a(n)/n as a separate sequence; first 8 terms are 1,1,2,2,4,2,
               6,3
%e A140965 a(8) = 24 because 8 has only 4 divisors and 16 has only 5, but 24 has 
               8 and so 24 qualifies.
%t A140965 a = {}; For[n = 1, n < 50, n++, i = 1; While[DivisorSigma[0, i*n] < n, 
               i++ ]; AppendTo[a, n*i]]; a [From Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), 
               Aug 28 2008]
%Y A140965 Sequence in context: A072230 A028332 A124827 this_sequence A002618 A069553 
               A143481
%Y A140965 Adjacent sequences: A140962 A140963 A140964 this_sequence A140966 A140967 
               A140968
%K A140965 nonn
%O A140965 1,2
%A A140965 J. Lowell (jhbubby(AT)mindspring.com), Jul 27 2008
%E A140965 More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), 
               Aug 28 2008

    
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 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research