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.

A218550 a(n) = A213725(A218548(n)).

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 13, 19, 15, 16, 27, 39, 51, 67
Offset: 1

Views

Author

Antti Karttunen, Nov 04 2012

Keywords

Comments

a(n) tells the maximum depth + 1 of the n-th record size finite side-tree in the infinite beanstalk.

Examples

			a(7)=6 as the finite tree of 7 leaves (233, 234, 235, 238, 245, 250 and 251) and 6 internal vertices (244, 239, 232, 229, 228 and 224) rooted at 224 has the maximum depth of 5 (the path 224 -> 228 -> 232 -> 239 -> 244 -> 250/251).
		

Crossrefs

Cf. A218549.

Programs