cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A186650 Total number of n-digit numbers requiring 2 positive biquadrates in their representation as sum of biquadrates.

Original entry on oeis.org

1, 4, 9, 29, 100, 317, 1007, 3146, 10016, 31712, 100204, 316799, 1002314, 3169309, 10022310, 31693094
Offset: 1

Views

Author

Martin Renner, Feb 25 2011

Keywords

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.

Crossrefs

Programs

  • 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 y4A003336(k) then i:=i+1; fi; od: return(i); end: for n from 1 do print(a(n)); od;

Formula

a(n) = A186649(n)-A186649(n-1).

Extensions

a(6) from Martin Renner, Feb 26 2011
a(7)-a(16) from Giovanni Resta, Apr 29 2016