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.

A062860 Smallest j with n nodes in its riff (rooted index-functional forest).

Original entry on oeis.org

1, 2, 3, 5, 10, 15, 30, 55, 105, 165, 330, 660, 1155, 2145, 4290, 7755, 15015, 30030, 54285, 100815, 201630, 403260, 705705, 1411410, 2822820, 5645640, 11392095, 20465445, 40930890, 79744665, 159489330, 318978660, 637957320, 1321483020
Offset: 0

Views

Author

Jon Awbrey, Jun 25 2001

Keywords

Comments

Greatest j with n nodes in its riff is given by A014221(n+1).

Crossrefs

Extensions

More terms from David W. Wilson, Jun 26 2001