|
Search: id:A126888
|
|
|
| A126888 |
|
a(n) is the smallest positive integer such that floor(a(n)/d(a(n))) = n, where d(m) is the number of positive divisors of m. |
|
+0
4
|
|
| 1, 5, 7, 28, 11, 13, 44, 17, 19, 63, 23, 51, 55, 29, 31, 49, 69, 37, 77, 41, 43, 91, 47, 147, 153, 53, 111, 115, 59, 61, 125, 129, 67, 207, 71, 73, 296, 155, 79, 121, 83, 680, 261, 89, 183, 185, 284, 97, 399, 101, 103, 209, 107, 109, 221, 113, 459, 235, 237, 363, 247, 249
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Is a(n) well-defined? Does every positive integer n equal floor(m/d(m)) for some m?
|
|
LINKS
|
Hugo van der Sanden and D. W. Wilson, Table of n, a(n) for n = 1..10000
|
|
MATHEMATICA
|
f[n_] := Block[{k = 1}, While[Floor[k/Length[Divisors[k]]] != n, k++ ]; k]; Table[f[n], {n, 62}] (*Chandler*)
|
|
CROSSREFS
|
Cf. A000005, A126889, A078709, A125056, A125057.
Sequence in context: A135606 A051845 A029668 this_sequence A087901 A018776 A104683
Adjacent sequences: A126885 A126886 A126887 this_sequence A126889 A126890 A126891
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Dec 30 2006
|
|
EXTENSIONS
|
Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Jan 04 2007
|
|
|
Search completed in 0.002 seconds
|
