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 A166710 #9 May 24 2016 16:05:18
%S A166710 10,10,10,10,11,111,23,21,212,32,1011,52,221,223,65,203,65,141,124,
%T A166710 131,133,87,123,108,117,101,10211,212,131,11012,241,11212,254,164,175,
%U A166710 1101,313,431,326,335,218,265,232,234,238,241,11010011,22021,443,274,22122
%N A166710 a(n)=prime(n) written in base the largest digit of prime(n).
%C A166710 If prime(n) is a repunit then a(n)=prime(n) by convention.
%H A166710 G. C. Greubel, <a href="/A166710/b166710.txt">Table of n, a(n) for n = 1..10000</a>
%e A166710 a(6)=23 because p(6)=13 written in base 3 is 23,
%e A166710 a(7)=21 because p(7)=19 written in base 9 is 21.
%t A166710 Table[p=Prime[n];id=IntegerDigits[p];ma=If[Max[id]==1,10,Max[id]];FromDigits[IntegerDigits[p,ma]],{n,1,128}]
%Y A166710 Cf. A072803 n written in base Mod[n, 10].
%K A166710 base,nonn
%O A166710 1,1
%A A166710 _Zak Seidov_, Oct 18 2009