|
%I #16 Jun 29 2023 13:06:31
%S 0,1,6,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,
%T 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 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
%N Total number of n-digit numbers requiring 19 positive biquadrates in their representation as sum of biquadrates.
%C 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) + A186681(n) + A186683(n) + a(n) = A052268(n)
%C a(n) = 0 for n >= 4. - _Nathaniel Johnston_, May 09 2011
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/WaringsProblem.html">Waring's Problem.</a>
%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (1).
%F a(n) = A186684(n) - A186684(n-1).
%Y Cf. A046050, A099591.
%K nonn,base,easy
%O 1,3
%A _Martin Renner_, Feb 25 2011
|
