Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #19 Apr 29 2016 05:13:42
%S 1,6,60,587,7277,91470,1151734,14116900,166220264,1888964884,
%T 20910204634
%N Total number of n-digit numbers requiring 5 positive biquadrates in their representation as sum of biquadrates.
%C 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 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/WaringsProblem.html">Waring's Problem.</a>
%F a(n) = A186655(n) - A186655(n-1).
%Y Cf. A003339, A186655.
%K nonn,base,more
%O 1,2
%A _Martin Renner_, Feb 25 2011
%E a(5)-a(11) from _Giovanni Resta_, Apr 29 2016