id:A153247 - OEIS Search Results

Search: id:A153247

Displaying 1-1 of 1 results found.

page 1

Number of fleeing trees computed for Catalan bijection A123493.

+0
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; listen)

	OFFSET	`0,5`
	COMMENT	`See comments at A153246. Essentially, A123493 does not extend uniquely to an automorphism of infinite binary tree, because its behaviour is dependent on whether certain vertices of a finite binary tree are leaves (terminal nodes) or not. Similarly for bijections like A127387 and A127379.`
	PROGRAM	`(MIT Scheme:) (define (A153247 n) (count-fleeing-trees n A123493))`
	CROSSREFS	`Cf. A153248.` `Sequence in context: A022329 A087466 A153248 this_sequence A071432 A025253 A112178` `Adjacent sequences: A153244 A153245 A153246 this_sequence A153248 A153249 A153250`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen (His-Firstname.His-Surname(AT)gmail.com), Dec 22 2008`

page 1

Search completed in 0.004 seconds

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.

AT&T Labs Research