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 A286351 #18 Aug 15 2025 09:11:37
%S A286351 0,0,1,0,1,0,1,0,1,0,2,0,1,0,2,0,1,6,3,0,1,1,3,0,4,1,2,1,2,2,8,0,0,0,
%T A286351 7,3,10,1,4,1,2,3,2
%N A286351 a(n) is the number of decompositions of 2^(n-1)*(2^n-1) into 3 nonnegative cubes.
%C A286351 From _Giovanni Resta_, May 09 2017: (Start)
%C A286351 The triples corresponding to n<=40 are reported in the cited paper. Those corresponding to a(41)-a(43) are:
%C A286351 41: (1806336, 90370048, 118874112), (9340200, 89678370, 119250526);
%C A286351 42: (24663948, 61547632, 211219316), (37015132, 42806240, 188598692), (94126080, 154352128, 172803584);
%C A286351 43: (16384, 266321920, 270516224), (94478388, 245170170, 284820886).
%C A286351 (End)
%H A286351 Maciej Ulas, <a href="https://arxiv.org/abs/1705.01074">A note on the Diophantine equation 2^(n-1)*(2^n-1)=x^3+y^3+z^3</a>, arXiv:1705.01074 [math.NT], 2017. See Table 1 p. 4.
%t A286351 Table[Length@ PowersRepresentations[2^(n - 1) (2^n - 1), 3, 3] - Boole[n == 1], {n, 17}] (* _Michael De Vlieger_, May 08 2017 *)
%Y A286351 Cf. A006516, A051343.
%K A286351 nonn,more
%O A286351 1,11
%A A286351 _Michel Marcus_, May 08 2017
%E A286351 a(41)-a(43) from _Giovanni Resta_, May 09 2017