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

A186673
Total number of positive integers below 10^n requiring 14 positive biquadrates in their representation as sum of biquadrates.
19
0, 6, 66, 698, 6833, 66965, 667080, 6667198, 66667327, 666667454, 6666667590
OFFSET
1,2
COMMENTS
A114322(n) + A186649(n) + A186651(n) + A186653(n) + A186655(n) + A186657(n) + A186659(n) + A186661(n) + A186663(n) + A186665(n) + A186667(n) + A186669(n) + A186671(n) + a(n) + A186675(n) + A186677(n) + A186680(n) + A186682(n) + A186684(n) = A002283(n)
LINKS
Eric Weisstein's World of Mathematics, Waring's Problem.
CROSSREFS
Sequence in context: A119234 A119232 A186675 * A213453 A186671 A131519
KEYWORD
nonn,more
AUTHOR
Martin Renner, Feb 25 2011
EXTENSIONS
a(5)-a(6) from Lars Blomberg, May 08 2011
a(7) from Charles R Greathouse IV, May 08 2011
a(8)-a(9) from Hiroaki Yamanouchi, Oct 13 2014
a(10)-a(11) from Giovanni Resta, Apr 29 2016
STATUS
approved