cp's OEIS Frontend

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.

A343267 Numbers that are not the sum of four or fewer terms from A020330 (not necessarily distinct).

This page as a plain text file.
%I A343267 #7 Apr 09 2021 22:18:01
%S A343267 1,2,4,5,7,8,11,14,17,22,27,29,32,34,37,41,44,47,53,62,95,104,107,113,
%T A343267 116,122,125,131,134,140,143,148,155,158,160,167,407,424,441,458,475,
%U A343267 492,509,526,552,560,569,587,599,608,613,620,638,653,671,686
%N A343267 Numbers that are not the sum of four or fewer terms from A020330 (not necessarily distinct).
%C A343267 Madhusudan et al. (2018) proved that a(56) = 686 is the last term of this sequence.
%H A343267 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 A343267 v = Table[n + n * 2^Floor[Log2[n] + 1], {n, 0, 20}]; Complement[Range[0, 700], Plus @@@ Tuples[v, 4]]
%Y A343267 Cf. A020330, A290334, A290335, A298731, A343268.
%K A343267 nonn,fini,full
%O A343267 1,2
%A A343267 _Amiram Eldar_, Apr 09 2021