Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A161655
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A161655 a(n) = the smallest multiple of {the number of divisors of n} that is >= n. +0
2
1, 2, 4, 6, 6, 8, 8, 8, 9, 12, 12, 12, 14, 16, 16, 20, 18, 18, 20, 24, 24, 24, 24, 24, 27, 28, 28, 30, 30, 32, 32, 36, 36, 36, 36, 36, 38, 40, 40, 40, 42, 48, 44, 48, 48, 48, 48, 50, 51, 54, 52, 54, 54, 56, 56, 56, 60, 60, 60, 60, 62, 64, 66, 70, 68, 72, 68, 72, 72, 72, 72, 72 (list; graph; listen)
OFFSET

1,2

MAPLE

with(numtheory): a := proc (n) local k: for k while k*tau(n) < n do end do: k*tau(n) end proc: seq(a(n), n = 1 .. 75); [From Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 21 2009]

CROSSREFS

A161654

Sequence in context: A114218 A111973 A133691 this_sequence A092517 A128558 A090346

Adjacent sequences: A161652 A161653 A161654 this_sequence A161656 A161657 A161658

KEYWORD

nonn

AUTHOR

Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Jun 15 2009

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 21 2009

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 November 29 12:42 EST 2009. Contains 167602 sequences.


AT&T Labs Research