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.

Showing 1-1 of 1 results.

A072789 The size of the parenthesizations obtained with the global ranking/unranking scheme presented in A072787-A072788.

Original entry on oeis.org

1, 2, 2, 3, 3, 3, 4, 3, 4, 4, 4, 4, 3, 4, 5, 4, 5, 4, 4, 4, 5, 5, 5, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 5, 4, 6, 5, 5, 6, 5, 5, 6, 5, 6, 6, 5, 5, 5, 6, 6, 5, 6, 5, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 6, 6, 6, 6, 7, 5, 6, 5, 6, 6, 6, 7, 6, 6, 7, 5, 6, 7, 7, 6, 6, 6, 5, 6, 7, 6, 7, 7, 6, 6, 7, 7, 7, 6, 5, 5
Offset: 1

Views

Author

Antti Karttunen, Jun 12 2002

Keywords

Comments

To get a cleaner looking table, the term a(0)=0 is not listed here.

Crossrefs

A072790(n) gives the maximum position where the value n occurs. See the comment at A072787. Same triangle computed modulo 2: A072792.
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.