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 A141747 #14 Feb 11 2022 07:44:28
%S A141747 0,1,1,1,2,0,1,0,1,1,2,0,1,0,0,0,2,0,1,0,0,0,0,0,1,0,0,1,1,0,1,0,1,0,
%T A141747 2,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,1,0,
%U A141747 0,0,0,0,1,0,0,0,0,0,0,0,0,1,1,0,1,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0
%N A141747 a(n) is the number of nonnegative integer pairs i,j such that n = 2^i + 3^j.
%H A141747 Robert Israel, <a href="/A141747/b141747.txt">Table of n, a(n) for n = 1..10000</a>
%F A141747 G.f.: ( Sum_{i>=0} x^(2^i) ) * ( Sum_{j>=0} x^(3^j) ). - _Ilya Gutkovskiy_, Feb 10 2022
%e A141747 a(5) = 2, using (i,j) = (1,1) and (2,0).
%p A141747 f:= proc(n) local j,t,s;
%p A141747 t:= 0;
%p A141747 for j from 0 to floor(log[3](n)) do
%p A141747 s:= n - 3^j;
%p A141747 if s = 2^padic:-ordp(s,2) then t:= t+1 fi
%p A141747 od;
%p A141747 t
%p A141747 end proc:
%p A141747 map(f, [$1..200]); # _Robert Israel_, Jun 08 2020
%Y A141747 Cf. A085634, A141748.
%K A141747 nonn
%O A141747 1,5
%A A141747 _Clark Kimberling_, Jul 01 2008