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 A091465 #3 Mar 30 2012 17:30:59
%S A091465 11,23,149,389,6389,38669,89899,688999,4998989,46998899,288989999,
%T A091465 2688989999,8889899999,68898899999,1488988999999,3888998899999,
%U A091465 128889898999999,348889899899999,1888888999999999,16888888999999999
%N A091465 Smallest prime with digit product 6^n.
%t A091465 NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; a = Table[0, {10}]; p = 2; Do[ q = Log[6, Times @@ IntegerDigits[p]]; If[q != 0 && IntegerQ[q] && a[[q]] == 0, a[[q]] = p; Print[q, " = ", p]]; p = NextPrim[p], {n, 1, 10^9}]; a
%Y A091465 Cf. A089365, A088653, A090840, A089298, A090841.
%K A091465 nonn,base
%O A091465 0,1
%A A091465 _Robert G. Wilson v_, Jan 12 2004