The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A153247 Number of fleeing trees computed for Catalan bijection A123493. 3
 0, 0, 1, 1, 2, 1, 0, 2, 1, 3, 2, 0, 2, 1, 3, 1, 3, 3, 2, 1, 0, 2, 1, 4, 3, 1, 3, 2, 3, 1, 3, 3, 2, 1, 0, 2, 1, 4, 3, 0, 2, 1, 2, 2, 4, 4, 3, 3, 1, 3, 2, 2, 2, 0, 3, 1, 2, 3, 3, 2, 1, 1, 0, 2, 1, 5, 4, 2, 4, 3, 4, 2, 4, 4, 3, 2, 1, 3, 2, 4, 3, 0, 2, 1, 2, 2, 4, 4, 3, 3, 1, 3, 2, 2, 2, 0, 3, 1, 2, 3, 3, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS See comments at A153246. Essentially, A123493 does not extend uniquely to an automorphism of infinite binary tree, because its behavior is dependent on whether certain vertices of a finite binary tree are leaves (terminal nodes) or not. Similarly for bijections like A127387 and A127379. LINKS PROG (MIT Scheme:) (define (A153247 n) (count-fleeing-trees n A123493)) CROSSREFS Cf. A153248. Sequence in context: A153248 A221179 A341608 * A071432 A194508 A240808 Adjacent sequences:  A153244 A153245 A153246 * A153248 A153249 A153250 KEYWORD nonn AUTHOR Antti Karttunen, Dec 22 2008 EXTENSIONS Edited by Charles R Greathouse IV, May 13 2010 STATUS approved

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

Last modified April 14 20:23 EDT 2021. Contains 342962 sequences. (Running on oeis4.)