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”).
%I #5 Mar 30 2012 19:00:24
%S 0,0,0,1024,59049,0,9765625,0,282475249,0,25937424601,137858491849,
%T 6131066257801,41426511213649,819628286980801,4808584372417849,
%U 52599132235830049,713342911662882601,9468276082626847201,73742412689492826049,339456738992222314849,9099059901039401398249
%N a(n) = the largest n-digit number with exactly 11 divisors, a(n) = 0 if no such number exists.
%C a(n) = the largest n-digit number of the form p^10 (p = prime), a(n) = 0 if no such number exists.
%F A000005(a(n)) = 11.
%F a(n) >= A182681(n).
%Y Cf. A030629, A182681.
%K nonn,base
%O 1,4
%A _Jaroslav Krizek_, Nov 27 2010