The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A181375 Total number of positive integers below 10^n requiring 2 positive cubes in their representation as sum of cubes. 9
 2, 9, 41, 202, 938, 4354, 20330, 94625, 439959, 2045048, 9500746, 44124084, 204883131, 951202028, 4415710979, 20497646229, 95146359635 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS A061439(n) + a(n) + A181377(n) + A181379(n) + A181381(n) + A181400(n) + A181402(n) + A181404(n) + A130130(n) = A002283(n). LINKS Table of n, a(n) for n=1..17. Eric Weisstein's World of Mathematics, Waring's Problem. MAPLE iscube:=proc(n) if root(n, 3)=trunc(root(n, 3)) then true; else false; fi; end: isA003325:=proc(n) local x, y3; if iscube(n) then false; else for x from 1 do y3:=n-x^3; if y3

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.

Last modified September 15 01:49 EDT 2024. Contains 375929 sequences. (Running on oeis4.)