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 A181380 #24 Apr 03 2025 11:21:54 %S A181380 1,17,224,3101,43340,558806,6615757,73663693,784419159 %N A181380 Total number of n-digit numbers requiring 4 positive cubes in their representation as sum of cubes. %C A181380 A181354(n) + A181376(n) + A181378(n) + a(n) + A181384(n) + A181401(n) + A181403(n) + A181405(n) + A171386(n) = A052268(n). %H A181380 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/WaringsProblem.html">Waring's Problem</a>. %F A181380 a(n) = A181379(n) - A181379(n-1). %Y A181380 Cf. A047703, A181379. %Y A181380 Cf. A052268, A181354, A181376, A181378, A181384, A181401, A181403, A181405, A171386. %K A181380 nonn,base,more %O A181380 1,2 %A A181380 _Martin Renner_, Jan 28 2011 %E A181380 a(5)-a(9) from _Lars Blomberg_, Jan 15 2014