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.

A003228 Endpoints in trees with n nodes.

Original entry on oeis.org

1, 2, 2, 5, 9, 21, 43, 101, 226, 556, 1333, 3365, 8500, 22007, 57258, 151264, 401761, 1077063, 2902599, 7871250, 21440642, 58672589, 161155637, 444240627, 1228400744, 3406668865, 9472308269, 26402207803, 73755064178
Offset: 1

Views

Author

Keywords

References

  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Formula

a(n) = Sum_{k=1..n} k*c(n, k), where c(n, k) = A055290(n, k) has g.f. (1-x+x*y)*B(x, y)+(1/2)*(B(x^2, y^2)-B(x, y)^2) and B(x, y) is g.f. for A055372.

Extensions

Corrected and extended with formula by Christian G. Bower, May 25 2000