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

 

Logo

The October issue of the Notices of the Amer. Math. Soc. has an article about the OEIS.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A182697 a(n) = the smallest 5-digit number with exactly n divisors, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

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

See A182697(n) - the largest 5-digit number with exactly n divisors.

Sequence in context: A210760 A164968 A165296 * A101442 A173029 A256838

Adjacent sequences:  A182694 A182695 A182696 * A182698 A182699 A182700

KEYWORD

nonn,fini,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 | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 24 22:27 EDT 2018. Contains 315360 sequences. (Running on oeis4.)