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!)
A182671 a(n) = the smallest n-digit number with exactly 6 divisors, a(n) = 0 if no such number exists. 1
0, 12, 116, 1004, 10012, 100017, 1000028, 10000036, 100000036, 1000000017, 10000000004, 100000000017, 1000000000028, 10000000000036, 100000000000019, 1000000000000025, 10000000000000091, 100000000000000028, 1000000000000000179, 10000000000000000196 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(n) = the smallest n-digit number of the form p^5 or p^2*q^1, (p, q = distinct primes), a(n) = 0 if no such number exists.
LINKS
FORMULA
A000005(a(n)) = 6.
MATHEMATICA
Table[k=10^(n-1); While[k<10^n && DivisorSigma[0, k] != 6, k++]; If[k==10^n, k=0]; k, {n, 10}]
CROSSREFS
Cf. A182672 (largest n-digit number with exactly 6 divisors).
Sequence in context: A027285 A238930 A304827 * A154346 A016142 A105218
KEYWORD
nonn,base
AUTHOR
Jaroslav Krizek, Nov 27 2010
EXTENSIONS
Extended by T. D. Noe, Nov 29 2010
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 19 05:19 EDT 2024. Contains 371782 sequences. (Running on oeis4.)