login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A218550 a(n) = A213725(A218548(n)) 3
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
(Scheme): (define (A218550 n) (A213725 (A218548 n)))
CROSSREFS
Cf. A218549.
Sequence in context: A322854 A322802 A322799 * A127273 A143287 A271952
KEYWORD
nonn
AUTHOR
Antti Karttunen, Nov 04 2012
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 04:42 EDT 2024. Contains 371964 sequences. (Running on oeis4.)