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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069654 a(1) = 1; for n > 1, a(n) = smallest number > a(n-1) having exactly n divisors. 2
1, 2, 4, 6, 16, 18, 64, 66, 100, 112, 1024, 1035, 4096, 4288, 4624, 4632, 65536, 65572, 262144, 262192, 263169, 269312, 4194304, 4194306, 6765201, 6787072, 6796449, 6796736, 268435456, 268437200, 1073741824, 1073741830, 1088472064 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..33.

MATHEMATICA

d=1; lst={}; Do[If[Length[Divisors[n]]==d, AppendTo[lst, n]; d++ ], {n, 10!}]; lst (* Vladimir Joseph Stephan Orlovsky, Aug 12 2009 *)

CROSSREFS

Cf. A002182, A005179.

If "exactly" is changed to "at least", we get A072121.

Sequence in context: A114874 A100361 A259939 * A000068 A067662 A248334

Adjacent sequences:  A069651 A069652 A069653 * A069655 A069656 A069657

KEYWORD

nonn

AUTHOR

Amarnath Murthy, Apr 04 2002

EXTENSIONS

Corrected and extended by Vladeta Jovovic, Jun 19 2002

More terms from David Wasserman, Apr 21 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 20 15:13 EDT 2019. Contains 326152 sequences. (Running on oeis4.)