OFFSET
1,3
COMMENTS
a(n) tells the maximum depth + 1 of the n-th record size finite side-tree in the infinite beanstalk.
EXAMPLE
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
KEYWORD
nonn
AUTHOR
Antti Karttunen, Nov 04 2012
STATUS
approved