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 A186681 #20 Feb 16 2025 08:33:14 %S A186681 0,3,30,30,2,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 A186681 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 A186681 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 %N A186681 Total number of n-digit numbers requiring 17 positive biquadrates in their representation as sum of biquadrates. %C A186681 A161905(n) + A186650(n) + A186652(n) + A186654(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) + a(n) + A186683(n) + A186685(n) = A052268(n) %C A186681 a(n) = 0 for n >= 6. - _Nathaniel Johnston_, May 09 2011 %H A186681 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/WaringsProblem.html">Waring's Problem</a>. %H A186681 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (1). %F A186681 a(n) = A186680(n) - A186680(n-1). %Y A186681 Cf. A046048, A099591, A186683, A186685. %K A186681 nonn,base,easy %O A186681 1,2 %A A186681 _Martin Renner_, Feb 25 2011