cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Jan 03 2004

Keywords

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.

Crossrefs

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