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 #24 Jul 27 2024 09:40:58
%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.
%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).
%F 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).
%F a(n) = 0 for n >= 4. - _Nathaniel Johnston_, May 09 2011
%t PadRight[{0, 1, 6}, 100] (* _Paolo Xausa_, Jul 26 2024 *)
%Y Cf. A046050, A052268, A099591.
%Y Cf. A161905, A186650, A186652, A186654, A186656, A186658, A186660(n) + A186662, A186664, A186666, A186668, A186670, A186672, A186674, A186676, A186678, A186681, A186683, A186684.
%K nonn,base,easy
%O 1,3
%A _Martin Renner_, Feb 25 2011