login
Smallest GF2X-Matula number i which encodes a tree of n nodes, i.e., for which A091238(i) = n.
3

%I #7 Jul 28 2017 23:31:46

%S 1,2,3,6,5,9,15,23,17,34,51,75,85,153,255,359,257,514,771,1275,1285,

%T 2313,3855,5911,4369,8738,13107,19275,21845,39321,65535

%N Smallest GF2X-Matula number i which encodes a tree of n nodes, i.e., for which A091238(i) = n.

%H A. Karttunen, <a href="/A091247/a091247.scm.txt">Scheme-program for computing this sequence.</a>

%Y Analogous to A005517. A091240 gives the largest i with number of nodes = n. Cf. A091238, A091241.

%K nonn

%O 1,2

%A _Antti Karttunen_, Jan 03 2004