|
|
|
|
0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 13, 19, 15, 16, 27, 39, 51, 67
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
a(n) tells the maximum depth + 1 of the n-th record size finite side-tree in the infinite beanstalk.
|
|
LINKS
|
|
|
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).
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|