|
%I #4 Mar 31 2012 13:21:17
%S 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,
%T 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,
%U 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
%N Number of fleeing trees computed for Catalan bijection A123493.
%C 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.
%o (MIT Scheme:) (define (A153247 n) (count-fleeing-trees n A123493))
%Y Cf. A153248.
%K nonn
%O 0,5
%A _Antti Karttunen_, Dec 22 2008
%E Edited by _Charles R Greathouse IV_, May 13 2010
|
