login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A182686
a(n) = the largest n-digit number with exactly 13 divisors, a(n) = 0 if no such number exists.
2
0, 0, 0, 4096, 0, 531441, 0, 0, 244140625, 0, 13841287201, 0, 3138428376721, 23298085122481, 582622237229761, 2213314919066161, 21914624432020321, 787662783788549761, 6582952005840035281, 39959630797262576401
OFFSET
1,4
COMMENTS
a(n) = the largest n-digit number of the form p^12 (p = prime), a(n) = 0 if no such number exists.
LINKS
FORMULA
A000005(a(n)) = 13.
a(n) = A182685(n) for n <= 17.
MAPLE
f:= proc(n) local r;
r:= prevprime(ceil(10^(n/12)))^12;
if r < 10^(n-1) then 0 else r fi;
end proc:
f(1):= 0: f(2):= 0: f(3):=0:
map(f, [$1..30]); # Robert Israel, Apr 03 2019
PROG
(PARI) a(n) = my(r=precprime(ceil(10^(n/12))-1)^12); if(r < 10^(n-1), return(0)); r \\ Adapted from Robert Israel's Maple program; Felix Fröhlich, Apr 03 2019
CROSSREFS
Sequence in context: A212935 A076154 A182685 * A369823 A176768 A223601
KEYWORD
nonn,base
AUTHOR
Jaroslav Krizek, Nov 27 2010
STATUS
approved