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 A186656 #20 Feb 16 2025 08:33:14 %S A186656 1,6,60,587,7277,91470,1151734,14116900,166220264,1888964884, %T A186656 20910204634 %N A186656 Total number of n-digit numbers requiring 5 positive biquadrates in their representation as sum of biquadrates. %C A186656 A102831(n) + A186650(n) + A186652(n) + A186654(n) + a(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 A186656 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/WaringsProblem.html">Waring's Problem.</a> %F A186656 a(n) = A186655(n) - A186655(n-1). %Y A186656 Cf. A003339, A186655. %K A186656 nonn,base,more %O A186656 1,2 %A A186656 _Martin Renner_, Feb 25 2011 %E A186656 a(5)-a(11) from _Giovanni Resta_, Apr 29 2016