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