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!)
A186652 Total number of n-digit numbers requiring 3 positive biquadrates in their representation as sum of biquadrates. 17

%I #16 Apr 29 2016 05:13:57

%S 1,5,23,112,648,3564,19820,110506,622268,3501263,19699896

%N Total number of n-digit numbers requiring 3 positive biquadrates in their representation as sum of biquadrates.

%C 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.

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

%F a(n) = A186651(n) - A186651(n-1).

%Y Cf. A003337, A186651.

%K nonn,base,more

%O 1,2

%A _Martin Renner_, Feb 25 2011

%E a(5)-a(11) from _Giovanni Resta_, Apr 29 2016

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 March 28 11:59 EDT 2024. Contains 371254 sequences. (Running on oeis4.)