login
A186649
Total number of positive integers below 10^n requiring 2 positive biquadrates in their representation as sum of biquadrates.
19
1, 5, 14, 43, 143, 460, 1467, 4613, 14629, 46341, 146545, 463344, 1465658, 4634967, 14657277, 46350371, 146575269, 463514843, 1465769570, 4635173334, 14657724677, 46351830204, 146577415900, 463518545301, 1465774545251, 4635186340788, 14657746739771, 46351865753529
OFFSET
1,2
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).
LINKS
Eric Weisstein's World of Mathematics, Waring's Problem.
FORMULA
a(n) = binomial(b(x/2)+1, 2) + (Sum_{a=b(x/2)+1..b(x)} b(x-a^4)) - Sum_{m in A018786, m<=x} (A216284(m) - 1), where b(t) = floor(t^(1/4)) and x = 10^n - 1. - Martin Fuller, Jan 01 2026
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<x^4 then return false; elif isbiquadrate(y4) then return true; fi; od; fi; end:
a:=proc(n) local i, k; i:=0; for k from 2 to 10^n-1 do if isA003336(k) then i:=i+1; fi; od: return(i); end: for n from 1 do print(a(n)); od;
CROSSREFS
Cf. A003336.
Sequence in context: A197607 A296829 A102434 * A120901 A222988 A349222
KEYWORD
nonn
AUTHOR
Martin Renner, Feb 25 2011
EXTENSIONS
a(6) from Martin Renner, Feb 26 2011
a(7)-a(16) from Lars Blomberg, May 08 2011
a(17)-a(24) from Martin Fuller, Jan 01 2026
a(25)-a(28) from A003824 by Martin Fuller, Feb 01 2026
STATUS
approved