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 A181405 #15 Feb 16 2025 08:33:13 %S A181405 0,3,12,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, %T A181405 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, %U A181405 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 %N A181405 Total number of n-digit numbers requiring 8 positive cubes in their representation as sum of cubes. %C A181405 Arthur Wieferich proved that only 15 integers require eight cubes, cf. A018889. %C A181405 A181354(n) + A181376(n) + A181378(n) + A181380(n) + A181384(n) + A181401(n) + A181403(n) + a(n) + A171386(n) = A052268(n) %H A181405 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/WaringsProblem.html">Waring's Problem</a>. %F A181405 a(n) = A181404(n) - A181404(n-1). %Y A181405 Cf. A018889, A181404. %K A181405 nonn,base %O A181405 1,2 %A A181405 _Martin Renner_, Jan 28 2011