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 A265209 #14 Jan 20 2016 23:41:20
%S A265209 1,2,1,1,2,2,1,2,1,1,0,1,2,2,1,0,1,1,1,2,0,2,1,0,0,1,1,1,2,0,0,2,2,2,
%T A265209 1,1,0,1,2,2,1,2,2,1,0,2,1,2,1,2,1,2,1,2,0,1,1,0,2,0,2,0,1,0,2,2,1,1,
%U A265209 1,1,0,2,1,1,1,1,2,2,2,2,1,1,2,2
%N A265209 Irregular triangle read by rows in which row n lists the base-3 digits of 2^n, n >= 0.
%C A265209 The length of row n is A020915(n) = 1 + A136409(n).
%e A265209 Triangle begins:
%e A265209 1
%e A265209 2
%e A265209 1 1
%e A265209 2 2
%e A265209 1 2 1
%e A265209 1 0 1 2
%e A265209 2 1 0 1
%e A265209 1 1 2 0 2
%e A265209 1 0 0 1 1 1
%e A265209 2 0 0 2 2 2
%e A265209 1 1 0 1 2 2 1
%e A265209 2 2 1 0 2 1 2
%e A265209 1 2 1 2 1 2 0 1
%e A265209 1 0 2 0 2 0 1 0 2
%e A265209 2 1 1 1 1 0 2 1 1
%e A265209 1 1 2 2 2 2 1 1 2 2
%t A265209 (* Replace Flatten with Grid to display the triangle: *)
%t A265209 Flatten[Table[IntegerDigits[2^n, 3], {n, 0, 15}]]
%o A265209 (PARI) for(n=0,15,for(k=1,#digits(2^n,3),print1(digits(2^n,3)[k],", "))) \\ _Derek Orr_, Dec 24 2015
%Y A265209 Cf. A000079 (powers of 2), A003137, A004642 (powers of 2 written in base 3).
%Y A265209 Cf. A265210 (base 3 digits of 2^n in reverse order).
%K A265209 nonn,tabf,base
%O A265209 0,2
%A A265209 _L. Edson Jeffery_, Dec 04 2015