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

Offset: 0

Author

N. J. A. Sloane, Dec 02 2000

Keywords

• nonn
• easy
• nice
• tabf

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

Examples

			Irregular triangle begins:
  1;
  2;
  3,4;
  5,6,7,5,6,7,8;
  ...
		

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.

Crossrefs

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.