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 A290335 #23 Apr 09 2021 22:12:27
%S A290335 1,0,0,4,0,0,6,0,0,4,4,0,1,12,0,4,12,0,12,4,6,12,0,12,4,12,6,0,24,0,
%T A290335 10,12,0,16,0,12,10,0,12,12,13,0,12,12,0,16,12,0,16,24,6,24,12,0,32,
%U A290335 16,12,24,24,12,25,36,0,32,36,12,40,24,12,36,36,12,34,36,12,40,36,12,30,36,12,40,36,12,52,24,12,36,24,12,34,48,6,52,36,0,54,12,12
%N A290335 Number of representations of n as a sum of four terms of A020330 (including 0), where order matters.
%H A290335 Amiram Eldar, <a href="/A290335/b290335.txt">Table of n, a(n) for n = 0..10000</a>
%H A290335 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.
%e A290335 For n = 24 there are four representations, which are the distinct permutations of [15,3,3,3].
%t A290335 v = Table[k + k * 2^Floor[Log2[k] + 1], {k, 0, 8}]; a[n_] := If[(ip = IntegerPartitions[n, {4}, v]) == {}, 0, Plus @@ Length /@ (Permutations /@ ip)]; Table[a[n], {n, 0, v[[-1]]}] (* _Amiram Eldar_, Apr 09 2021 *)
%Y A290335 Cf. A020330, A261132, A290334, A298731.
%K A290335 nonn,look
%O A290335 0,4
%A A290335 _Jeffrey Shallit_, Jul 27 2017