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 A076702 #12 Mar 21 2013 16:09:55
%S A076702 4,8,9,25,27,32,49,125,128,169,243,289,361,529,841,961,1369,1849,2048,
%T A076702 2187,2197,2809,3125,3481,3721,4913,5041,5329,6241,6859,7921,8192,
%U A076702 12769,16807,18769,24389,32041,32761,36481,37249,39601,54289,68921
%N A076702 Distinct-digit prime powers of prime numbers.
%C A076702 Up to 10^10, there are only 108 distinct-digit prime powers of prime numbers; the last one being 2^29 = 536870912.
%H A076702 Ray Chandler, <a href="/A076702/b076702.txt">Table of n, a(n) for n = 1..108</a> (full sequence)
%t A076702 pp = Sort[ Flatten[ Table[ Prime[n]^Prime[i], {n, 1, PrimePi[ Sqrt[10^10]]}, {i, 1, PrimePi[ Floor[ Log[ Prime[n], 10^10]]]}]]]; a = {}; Do[ d = IntegerDigits[ pp[[n]]]; If[ Length[d] == Length[ Union[d]], a = Append[a, pp[[n]]]], {n, 1, 9965}]; a
%Y A076702 Cf. A053810, A075308.
%K A076702 nonn,base,fini,full
%O A076702 1,1
%A A076702 _Zak Seidov_, Oct 26 2002
%E A076702 Edited by _Robert G. Wilson v_, Oct 31 2002