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 A226808 #16 Apr 15 2023 14:34:19
%S A226808 2,3,5,6,7,9,13,17,21,26,27,29,33,37,41,57,65,69,89,126,127,129,133,
%T A226808 141,153,157,189,253,257,261,281,381,513,517,537,626,627,629,633,637,
%U A226808 641,657,689,753,881,1025,1029,1049,1137,1149,1649,2049,2053,2073,2173
%N A226808 Numbers of the form 2^j + 5^k, for j and k >= 0.
%C A226808 Conjecture: Each integer n > 4 can be written as a_1 + ... + a_k, where a_1,...,a_k are numbers of the form 2^a + 5^b (a,b>=0) (i.e., terms of the current sequence) with no one dividing another. This has been verified for n = 5..1200. - _Zhi-Wei Sun_, Apr 14 2023
%H A226808 T. D. Noe, <a href="/A226808/b226808.txt">Table of n, a(n) for n = 1..10000</a>
%t A226808 a = 2; b = 5; mx = 3000; Union[Flatten[Table[a^n + b^m, {m, 0, Log[b, mx]}, {n, 0, Log[a, mx - b^m]}]]]
%Y A226808 Cf. A004050 (2^j + 3^k), A226806-A226832 (cases to 8^j + 9^k).
%K A226808 nonn
%O A226808 1,1
%A A226808 _T. D. Noe_, Jun 19 2013