This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A182685 #6 Mar 30 2012 19:00:24 %S A182685 0,0,0,4096,0,531441,0,0,244140625,0,13841287201,0,3138428376721, %T A182685 23298085122481,582622237229761,2213314919066161,21914624432020321, %U A182685 353814783205469041,6582952005840035281,22563490300366186081 %N A182685 a(n) = the smallest n-digit number with exactly 13 divisors, a(n) = 0 if no such number exists. %C A182685 a(n) = the smallest n-digit number of the form p^12 (p = prime), a(n) = 0 if no such number exists. %F A182685 A000005(a(n)) = 13. %F A182685 a(n) = A182686(n) for n <= 17. %p A182685 A055642 := proc(n) max(1,ilog10(n)+1) ; end proc: %p A182685 A182685 := proc(n) for i from 1 do p := ithprime(i)^12 ; if A055642(p) > n then return 0 ; elif A055642(p) = n then return p; end if; end do: end proc: %Y A182685 Cf. A030631, A182686. %K A182685 nonn,base %O A182685 1,4 %A A182685 _Jaroslav Krizek_, Nov 27 2010