id:A091239 - OEIS Search Results

Search: id:A091239

Displaying 1-1 of 1 results found.

page 1

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

+0
4

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

	OFFSET	`1,2`
	LINKS	`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.` `Adjacent sequences: A091236 A091237 A091238 this_sequence A091240 A091241 A091242` `Sequence in context: A070038 A119790 A080029 this_sequence A043547 A064919 A064923`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen (His-Firstname.His-Surname(AT)iki.fi), Jan 03 2004`

page 1

Search completed in 0.005 seconds

Last modified October 10 20:39 EDT 2008. Contains 144831 sequences.

AT&T Labs Research