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

A058223

Tree of Meeussen sequences read across rows.

1, 2, 3, 4, 5, 6, 7, 5, 6, 7, 8, 8, 10, 11, 12, 8, 9, 11, 12, 13, 8, 9, 10, 12, 13, 14, 9, 10, 11, 12, 13, 9, 10, 11, 12, 13, 14, 9, 10, 11, 12, 13, 14, 15, 9, 10, 11, 12, 13, 14, 15, 16, 13, 16, 18, 19, 20, 13, 15, 18, 20, 21, 22, 13, 14, 16, 19, 21, 22, 23, 13, 14, 15, 17, 20, 22, 23, 24

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

OFFSET

0,2

COMMENTS

Labels on paths down the tree are Meeussen Sequences: b(1)=1 < b(2) <...< b(n) such that b(n)-1 has a unique representation as a sum of distinct b(i) (i<n).

LINKS

Sean A. Irvine, Table of n, a(n) for n = 0..10000

M. Cook and M. Kleber, Tournament sequences and Meeussen sequences, Electronic J. Comb. 7 (2000), #R44.

EXAMPLE

Irregular triangle begins:

3,4;

5,6,7,5,6,7,8;

...

CROSSREFS

A008934 gives number of children at level n. Cf. A058222.

Sequence in context: A366905 A348262 A038389 * A245355 A307785 A331305

Adjacent sequences: A058220 A058221 A058222 * A058224 A058225 A058226

KEYWORD

nonn,easy,nice,tabf

AUTHOR

N. J. A. Sloane, Dec 02 2000

STATUS

approved