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.

A181404 Total number of positive integers below 10^n requiring 8 positive cubes in their representation as sum of cubes.

Original entry on oeis.org

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
Offset: 1

Views

Author

Martin Renner, Jan 28 2011

Keywords

Comments

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

Crossrefs

Programs

Formula

A061439(n) + A181375(n) + A181377(n) + A181379(n) + A181381(n) + A181400(n) + A181402(n) + a(n) + A130130(n) = A002283(n).
a(n) = 15 for n > 2. - Charles R Greathouse IV, Sep 09 2011
G.f.: 3*x^2*(1+4*x)/(1-x). - Bruno Berselli, Sep 09 2011
E.g.f.: 3*(5*(exp(x) - 1 - x) - 2*x^2). - Stefano Spezia, May 21 2024

Extensions

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