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!)
A182673 a(n) = the smallest n-digit number with exactly 7 divisors, a(n) = 0 if no such number exists. 2
0, 64, 729, 0, 15625, 117649, 1771561, 24137569, 148035889, 2565726409, 10779215329, 128100283921, 1061520150601, 10942526586601, 122978496247489, 1014741853230169, 10372926089038969, 101513598260088169, 1055229678769825441, 10131553366728232321, 101842394378135916961 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(n) = the smallest n-digit number of the form p^6 (p = prime), a(n) = 0 if no such number exists.
LINKS
FORMULA
A000005(a(n)) = 7.
MAPLE
A182673 := proc(n) for i from 1 do p := ithprime(i)^6 ; if A055642(p) > n then return 0 ; elif A055642(p) = n then return p; end if; end do: end proc:
MATHEMATICA
Transpose[If[#[[1]]==#[[2]], {0, #[[2]]}, #]&/@Partition[ Table[ NextPrime[ Surd[10^n, 6]]^6, {n, 0, 40}], 2, 1]][[1]](* Harvey P. Dale, Oct 05 2015 *)
CROSSREFS
Sequence in context: A317229 A008513 A321830 * A182674 A351194 A048392
KEYWORD
nonn,base
AUTHOR
Jaroslav Krizek, Nov 27 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 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)