login

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”).

A186652
Total number of n-digit numbers requiring 3 positive biquadrates in their representation as sum of biquadrates.
17
1, 5, 23, 112, 648, 3564, 19820, 110506, 622268, 3501263, 19699896
OFFSET
1,2
COMMENTS
A102831(n) + A186650(n) + a(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) + A186685(n) = A052268(n), for n>1.
LINKS
Eric Weisstein's World of Mathematics, Waring's Problem.
FORMULA
a(n) = A186651(n) - A186651(n-1).
CROSSREFS
Sequence in context: A017975 A360100 A178873 * A199312 A320326 A299589
KEYWORD
nonn,base,more
AUTHOR
Martin Renner, Feb 25 2011
EXTENSIONS
a(5)-a(11) from Giovanni Resta, Apr 29 2016
STATUS
approved