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 A340051 #23 May 22 2021 14:35:31
%S A340051 0,1,2,10,11,12,100,101,102,110,111,112,1000,1001,1002,1010,1011,1012,
%T A340051 1100,1101,1102,1110,1111,1112,10000,10001,10002,10010,10011,10012,
%U A340051 10100,10101,10102,10110,10111,10112,11000,11001,11002,11010,11011,11012,11100,11101
%N A340051 Mixed-radix representation of n where the least significant digit is in base 3 and other digits are in base 2.
%H A340051 Kevin Ryde, <a href="/A340051/b340051.txt">Table of n, a(n) for n = 0..3072</a>
%H A340051 <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>.
%F A340051 a(n) = 10*A007088(floor(n/3)) + (n mod 3).
%F A340051 G.f.: x*(1+2*x)/(1-x^3) + 10/(1-x) * Sum_{k>=0} 10^k*x^(3*2^k)/(1 + x^(3*2^k)).
%o A340051 (PARI) a(n) = my(r); [n,r]=divrem(n,3); fromdigits(concat(binary(n),r));
%Y A340051 Cf. A007088 (base 2).
%Y A340051 Cf. A096304 (interpreted as ternary).
%K A340051 base,easy,nonn
%O A340051 0,3
%A A340051 _Kevin Ryde_, Apr 24 2021