A091240 - 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

A091240

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

2

1, 2, 4, 11, 47, 319, 3053, 40345

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

OFFSET

1,2

COMMENTS

Apparently from n=4 onward given by recurrence a(4) = A014580(4), a(5) = A014580(A014580(4)), a(6) = A014580(A014580(A014580(4))), etc.

LINKS

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

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

CROSSREFS

Analogous to A005518. A091239 gives the smallest i with number of nodes = n. Cf. A091230, A091238, A091241.

Sequence in context: A120259 A174632 A307592 * A068488 A096119 A117157

Adjacent sequences: A091237 A091238 A091239 * A091241 A091242 A091243

KEYWORD

nonn

AUTHOR

Antti Karttunen, Jan 03 2004

STATUS

approved