Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A143176
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A143176 a(1)=1. a(n) is the smallest positive multiple of n that has more divisors than a(n-1) has. +0
6
1, 2, 6, 12, 30, 36, 84, 120, 180, 240, 660, 720, 1560, 1260, 1680, 2880, 6120, 5040, 15960, 10080, 15120, 27720, 115920, 83160, 138600, 196560, 302400, 277200, 803880, 498960, 1562400, 665280, 720720, 1413720, 1441440, 2162160, 8205120 (list; graph; listen)
OFFSET

1,2

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

EXAMPLE

a(4)=12 has 6 divisors. Checking the multiples of 5: 1*5=5 has 2 divisors. 2*5=10 has 4 divisors. 3*5=15 has 4 divisors. 4*5=20 has 6 divisors. 5*5=25 has 3 divisors. So the first 5 positive multiples of 5 each have <= 6 divisors. But 6*5 = 30 has 8 divisors. And since 8 > 6, a(5) = 30.

CROSSREFS

Cf. A143177, A143178.

Sequence in context: A057582 A094779 A093387 this_sequence A081375 A024701 A038199

Adjacent sequences: A143173 A143174 A143175 this_sequence A143177 A143178 A143179

KEYWORD

nonn

AUTHOR

Leroy Quet Jul 28 2008

EXTENSIONS

a(9)-a(37) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Sep 05 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 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research