login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A123258 a(n) = n-th divisor of the smallest positive integer with at least n divisors. 1
1, 2, 4, 6, 6, 12, 12, 24, 36, 48, 30, 60, 30, 40, 60, 120, 90, 180, 120, 240, 90, 120, 180, 360, 120, 144, 180, 240, 360, 720, 420, 840, 315, 420, 630, 1260, 420, 560, 840, 1680, 315, 360, 420, 504, 630, 840, 1260, 2520, 360, 420, 504, 560, 630, 720, 840, 1008 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

a(n) = n-th divisor of A061799(n).

EXAMPLE

The smallest positive integer with at least 11 divisors is 60, which has 12 divisors.

So a(11) = the 11th divisor of 60, which is 30.

MATHEMATICA

f[n_] := Block[{k = 1, d}, While[d = Divisors[k]; Length[d] < n, k++ ]; d[[n]]]; Table[f[n], {n, 60}] (*Chandler*)

Do[k = 1; While[Length[Divisors[k]] < n, k++ ]; Print[Divisors[k][[n]]], {n, 100}] - Ryan Propper (rpropper(AT)stanford.edu), Nov 12 2006

CROSSREFS

Cf. A061799.

Sequence in context: A066820 A141677 A087459 * A104968 A142473 A132426

Adjacent sequences:  A123255 A123256 A123257 * A123259 A123260 A123261

KEYWORD

nonn

AUTHOR

Leroy Quet Nov 06 2006

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 11 2006

More terms from Ryan Propper (rpropper(AT)stanford.edu), Nov 12 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 22:48 EST 2012. Contains 206085 sequences.