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.

A186649 Total number of positive integers below 10^n requiring 2 positive biquadrates in their representation as sum of biquadrates.

Original entry on oeis.org

1, 5, 14, 43, 143, 460, 1467, 4613, 14629, 46341, 146545, 463344, 1465658, 4634967, 14657277, 46350371
Offset: 1

Views

Author

Martin Renner, Feb 25 2011

Keywords

Comments

A114322(n) + a(n) + A186651(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).

Crossrefs

Cf. A003336.

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;

Extensions

a(6) from Martin Renner, Feb 26 2011
a(7)-a(16) from Lars Blomberg, May 08 2011