login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A186651 Total number of positive integers below 10^n requiring 3 positive biquadrates in their representation as sum of biquadrates. 19

%I #14 Sep 30 2014 17:15:47

%S 1,6,29,141,789,4353,24173,134679,756947,4258210,23958106

%N Total number of positive integers below 10^n requiring 3 positive biquadrates in their representation as sum of biquadrates.

%C A114322(n) + A186649(n) + a(n) + A186653(n) + A186655(n) + A186657(n) + A186659(n) + A186661(n) + A186663(n) + A186665(n) + A186667(n) + A186669(n) + A186671(n) + A186673(n) + A186675(n) + A186677(n) + A186680(n) + A186682(n) + A186684(n) = A002283(n).

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/WaringsProblem.html">Waring's Problem.</a>

%Y Cf. A003337.

%Y Cf. A002283, A114322, A186649, A186653, A186655, A186657, A186659, A186661, A186663, A186665, A186667, A186669, A186671, A186673, A186675, A186677, A186680, A186682, A186684.

%K nonn,more

%O 1,2

%A _Martin Renner_, Feb 25 2011

%E a(5)-a(11) from _Lars Blomberg_, May 08 2011

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 16:23 EDT 2024. Contains 371989 sequences. (Running on oeis4.)