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 A181401 #12 Feb 16 2025 08:33:13 %S A181401 1,17,184,1123,2115,479,3,0,0 %N A181401 Total number of n-digit numbers requiring 6 positive cubes in their representation as sum of cubes. %C A181401 A181354(n) + A181376(n) + A181378(n) + A181380(n) + A181384(n) + a(n) + A181403(n) + A181405(n) + A171386(n) = A052268(n) %H A181401 Eric W. Weisstein, <a href="https://mathworld.wolfram.com/WaringsProblem.html">MathWorld -- Waring's Problem.</a> %F A181401 a(n) = A181400(n)-A181400(n-1) %Y A181401 Cf. A046040 %K A181401 nonn,more,base %O A181401 1,2 %A A181401 _Martin Renner_, Jan 28 2011 %E A181401 a(5)-a(9) from _Lars Blomberg_, Jan 15 2014