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 A226807 #12 Apr 20 2023 03:44:03
%S A226807 2,4,5,7,10,13,17,19,25,28,31,43,65,67,73,82,85,91,97,145,244,247,257,
%T A226807 259,265,283,307,337,499,730,733,745,793,985,1025,1027,1033,1051,1105,
%U A226807 1267,1753,2188,2191,2203,2251,2443,3211,4097,4099,4105,4123,4177,4339
%N A226807 Numbers of the form 3^j + 4^k, for j and k >= 0.
%C A226807 Conjecture: Each integer n > 8 can be written as a sum of finitely many numbers of the form 3^a + 4^b (a,b >= 0) with no one dividing another. This has been verified for all n <= 1500. - _Zhi-Wei Sun_, Apr 18 2023
%H A226807 T. D. Noe, <a href="/A226807/b226807.txt">Table of n, a(n) for n = 1..10000</a>
%t A226807 a = 3; b = 4; mx = 5000; Union[Flatten[Table[a^n + b^m, {m, 0, Log[b, mx]}, {n, 0, Log[a, mx - b^m]}]]]
%Y A226807 Cf. A004050 (2^j + 3^k), A226806-A226832 (cases to 8^j + 9^k).
%K A226807 nonn
%O A226807 1,1
%A A226807 _T. D. Noe_, Jun 19 2013