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 A186654 #18 Feb 16 2025 08:33:14 %S A186654 1,6,41,298,2720,24688,232970,2255588,22228377,220476980,2197066826 %N A186654 Total number of n-digit numbers requiring 4 positive biquadrates in their representation as sum of biquadrates. %C A186654 A102831(n) + A186650(n) + A186652(n) + a(n) + A186656(n) + A186658(n) + A186660(n) + A186662(n) + A186664(n) + A186666(n) + A186668(n) + A186670(n) + A186672(n) + A186674(n) + A186676(n) + A186678(n) + A186681(n) + A186683(n) + A186685(n) = A052268(n), for n>1. %H A186654 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/WaringsProblem.html">Waring's Problem.</a> %F A186654 a(n) = A186653(n) - A186653(n-1). %Y A186654 Cf. A003338, A186653. %K A186654 nonn,base,more %O A186654 1,2 %A A186654 _Martin Renner_, Feb 25 2011 %E A186654 a(5)-a(11) from _Giovanni Resta_, Apr 26 2016