This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A186650 Total number of n-digit numbers requiring 2 positive biquadrates in their representation as sum of biquadrates. 17
 1, 4, 9, 29, 100, 317, 1007, 3146, 10016, 31712, 100204, 316799, 1002314, 3169309, 10022310, 31693094 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A102831(n) + a(n) + A186652(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) = A186649(n)-A186649(n-1). MAPLE isbiquadrate:=proc(n) type(root(n, 4), posint); end: isA003336:=proc(n) local x, y4; if isbiquadrate(n) then false; else for x from 1 do y4:=n-x^4; if y4

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 October 20 04:37 EDT 2019. Contains 328247 sequences. (Running on oeis4.)