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