The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A186664 Total number of n-digit numbers requiring 9 positive biquadrates in their representation as sum of biquadrates. 18
 1, 5, 72, 842, 7755, 68550, 614030, 6014243, 60013964, 600013863, 6000013912 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A102831(n) + A186650(n) + A186652(n) + A186654(n) + A186656(n) + A186658(n) + A186660(n) + A186662(n) + a(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) = A186663(n) - A186663(n-1). CROSSREFS Cf. A003343, A186663. Sequence in context: A120808 A092204 A079874 * A223128 A079340 A268782 Adjacent sequences:  A186661 A186662 A186663 * A186665 A186666 A186667 KEYWORD nonn,base,more AUTHOR Martin Renner, Feb 25 2011 EXTENSIONS a(5)-a(11) from Giovanni Resta, Apr 29 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 1 22:12 EST 2021. Contains 349435 sequences. (Running on oeis4.)