%I #16 Apr 29 2016 05:16:02
%S 0,6,60,624,6071,60073,600069,6000069,60000069,600000061,6000000071
%N Total number of n-digit numbers requiring 15 positive biquadrates in their representation as sum of biquadrates.
%C A102831(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) + a(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) = A186675(n) - A186675(n-1).
%Y Cf. A046046, A186675.
%K nonn,base,more
%O 1,2
%A _Martin Renner_, Feb 25 2011
%E a(5)-a(11) from _Giovanni Resta_, Apr 29 2016
|