login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A181404 Total number of positive integers below 10^n requiring 8 positive cubes in their representation as sum of cubes. 10
0, 3, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

A061439(n) + A181375(n) + A181377(n) + A181379(n) + A181381(n) + A181400(n) + A181402(n) + a(n) + A130130(n) = A002283(n)

Also continued fraction expansion of (9+sqrt(229))/74. [Bruno Berselli, Sep 09 2011]

LINKS

Table of n, a(n) for n=1..61.

Weisstein, Eric W.: Waring's Problem

Index entries for linear recurrences with constant coefficients, signature (1).

FORMULA

a(n) = 15 for n > 2. - Charles R Greathouse IV, Sep 09 2011

G.f.: 3*x*(1+4*x)/(1-x). - Bruno Berselli, Sep 09 2011

PROG

(PARI) a(n)=if(n>2, 15, 3*n-3) \\ Charles R Greathouse IV, Oct 07 2015

CROSSREFS

Cf. A018889, A010854.

Sequence in context: A296842 A279925 A279534 * A096672 A344565 A289374

Adjacent sequences:  A181401 A181402 A181403 * A181405 A181406 A181407

KEYWORD

nonn,easy

AUTHOR

Martin Renner, Jan 28 2011

EXTENSIONS

a(5)-a(7) from Lars Blomberg, May 04 2011

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 31 02:33 EDT 2021. Contains 346367 sequences. (Running on oeis4.)