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 A181403 #12 Feb 16 2025 08:33:13 %S A181403 1,9,63,48 %N A181403 Total number of n-digit numbers requiring 7 positive cubes in their representation as sum of cubes. %C A181403 A181354(n) + A181376(n) + A181378(n) + A181380(n) + A181384(n) + A181401(n) + a(n) + A181405(n) + A171386(n) = A052268(n). %H A181403 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/WaringsProblem.html">Waring's Problem</a>. %F A181403 a(n) = A181402(n) - A181402(n-1). %Y A181403 Cf. A018890. %K A181403 nonn,more,base %O A181403 1,2 %A A181403 _Martin Renner_, Jan 28 2011