|
Search: id:A069654
|
|
|
| A069654 |
|
a(1) = 1; for n > 1, a(n) = smallest number > a(n-1) having exactly n divisors. |
|
+0
3
|
|
| 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; listen)
|
|
|
OFFSET
|
1,2
|
|
|
MATHEMATICA
|
d=1; lst={}; Do[If[Length[Divisors[n]]==d, AppendTo[lst, n]; d++ ], {n, 10!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Aug 12 2009]
|
|
CROSSREFS
|
Cf. A002182, A005179.
If "exactly" is changed to "at least", we get A072121.
Sequence in context: A096173 A114874 A100361 this_sequence A000068 A067662 A001774
Adjacent sequences: A069651 A069652 A069653 this_sequence A069655 A069656 A069657
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 04 2002
|
|
EXTENSIONS
|
Corrected and extended by Vladeta Jovovic (vladeta(AT)eunet.rs), Jun 19 2002
More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Apr 21 2003
|
|
|
Search completed in 0.003 seconds
|
