login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A182697 a(n) is the smallest 5-digit number with exactly n divisors, or a(n) = 0 if no such number exists. 2
0, 10007, 10201, 10001, 14641, 10012, 15625, 10002, 11236, 10096, 59049, 10004, 0, 10048, 13456, 10005, 65536, 10092, 0, 10064, 10816, 11264, 0, 10008, 10000, 12288, 10404, 10176, 0, 10044, 0, 10010, 25600, 0, 11664, 10140, 0, 0, 36864, 10032, 0, 10944, 0, 15360 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
A000005(a(n)) = n for a(n) > 0.
128 = max n such that a(n) > 0, a(n) = 0 for n > 128.
MATHEMATICA
Flatten[If[#=={}, 0, #]&/@Table[Select[Range[10000, 99999], DivisorSigma[0, #]==n&, 1], {n, 30}]] (* Harvey P. Dale, Oct 17 2012 *)
CROSSREFS
Cf. A182698 (the largest 5-digit number with exactly n divisors).
Sequence in context: A210760 A164968 A165296 * A101442 A173029 A256838
KEYWORD
nonn,base
AUTHOR
Jaroslav Krizek, Nov 27 2010
EXTENSIONS
Corrected by Harvey P. Dale, Oct 17 2012
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 13:04 EDT 2024. Contains 371945 sequences. (Running on oeis4.)