A091239 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A091239

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

1, 2, 3, 6, 5, 9, 15, 23, 17, 34, 51, 75, 85, 153, 255, 359, 257, 514, 771, 1275, 1285, 2313, 3855, 5911, 4369, 8738, 13107, 19275, 21845, 39321, 65535

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

LINKS

Table of n, a(n) for n=1..31.

A. Karttunen, Scheme-program for computing this sequence.

CROSSREFS

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

Sequence in context: A272214 A319785 A080029 * A145110 A257405 A373545

Adjacent sequences: A091236 A091237 A091238 * A091240 A091241 A091242

KEYWORD

nonn

AUTHOR

Antti Karttunen, Jan 03 2004

STATUS

approved