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 A343268 #9 Apr 10 2021 04:07:07
%S A343268 0,1,2,3,4,5,6,7,8,9,10,11,13,14,15,16,17,18,20,21,22,23,25,27,28,29,
%T A343268 30,32,34,35,37,39,41,42,44,46,47,49,51,53,56,58,62,65,67,74,83,88,95,
%U A343268 100,104,107,109,113,116,122,125,131,134,140,143,148,149,155
%N A343268 Numbers that are not the sum of exactly four terms from A020330 (not necessarily distinct).
%C A343268 Madhusudan et al. (2018) conjectured that a(112) = 1772 is the last term of this sequence.
%H A343268 Amiram Eldar, <a href="/A343268/b343268.txt">Table of n, a(n) for n = 1..112</a>
%H A343268 Parthasarathy Madhusudan, Dirk Nowotka, Aayush Rajasekaran and Jeffrey Shallit, <a href="https://drops.dagstuhl.de/opus/volltexte/2018/9600">Lagrange's Theorem for Binary Squares</a>, in: I. Potapov, P. Spirakis and J. Worrell (eds.), 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Schloss Dagstuhl, 2018, pp. 18:1-18:14; <a href="https://arxiv.org/abs/1710.04247">arXiv preprint</a>, arXiv:1710.04247 [math.NT], 2017-2018.
%t A343268 v = Table[n + n * 2^Floor[Log2[n] + 1], {n, 1, 31}]; Complement[Range[0, 2000], Plus @@@ Tuples[v, 4]]
%Y A343268 Cf. A020330, A290334, A290335, A298731, A343267.
%K A343268 nonn
%O A343268 1,3
%A A343268 _Amiram Eldar_, Apr 09 2021