Location via proxy:   [ UP ]   [Report a bug]   [Manage cookies]    No cookies    No scripts    No ads    No referrer    Show this form

login

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

 

Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!) A181380 Total number of n-digit numbers requiring 4 positive cubes in their representation as sum of cubes. 8 1, 17, 224, 3101, 43340, 558806, 6615757, 73663693, 784419159 (list; graph; refs; listen; history; text; internal format) OFFSET 1,2 COMMENTS A181354(n) + A181376(n) + A181378(n) + a(n) + A181384(n) + A181401(n) + A181403(n) + A181405(n) + A171386(n) = A052268(n) LINKS Table of n, a(n) for n=1..9. Eric W. Weisstein, MathWorld -- Waring's Problem. FORMULA a(n) = A181379(n)-A181379(n-1) CROSSREFS Cf. A047703 Sequence in context: A016174 A016281 A160398 * A081044 A016227 A155001 Adjacent sequences: A181377 A181378 A181379 * A181381 A181382 A181383 KEYWORD nonn,more,base AUTHOR Martin Renner, Jan 28 2011 EXTENSIONS a(5)-a(9) from Lars Blomberg, Jan 15 2014 STATUS approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 18 23:05 EDT 2024. Contains 375284 sequences. (Running on oeis4.)