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.

A080740 a(n) = number of m such that A080737(m) <= 2n.

Original entry on oeis.org

2, 5, 9, 17, 24, 35, 48, 62, 82, 108, 138, 180, 223, 272, 336, 401, 483, 578, 685, 814, 957, 1113, 1299, 1502, 1737, 2004, 2299, 2633, 3005, 3420, 3886, 4400, 4981, 5618, 6325, 7108, 7967, 8927, 9982, 11134, 12415, 13805, 15327, 17006, 18830, 20841
Offset: 0

Views

Author

N. J. A. Sloane, Mar 08 2003

Keywords

Comments

Total number of elements in first n rows of A080738.

Crossrefs

Partial sums of A080739.

Programs

  • Haskell
    a080740 n k = a080740_list !! n
    a080740_list = scanl1 (+) a080739_list  -- Reinhard Zumkeller, Jun 13 2012

Extensions

More terms from Devin Kilminster (devin(AT)maths.uwa.edu.au), Mar 10 2003