|
%I #10 Jul 29 2022 09:51:06
%S 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,
%T 11,12,13,9,10,11,12,13,14,9,10,11,12,13,14,15,9,10,11,12,13,14,15,16,
%U 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
%N Tree of Meeussen sequences read across rows.
%C 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).
%H Sean A. Irvine, <a href="/A058223/b058223.txt">Table of n, a(n) for n = 0..10000</a>
%H M. Cook and M. Kleber, <a href="https://doi.org/10.37236/1522">Tournament sequences and Meeussen sequences</a>, Electronic J. Comb. 7 (2000), #R44.
%e Irregular triangle begins:
%e 1;
%e 2;
%e 3,4;
%e 5,6,7,5,6,7,8;
%e ...
%Y A008934 gives number of children at level n. Cf. A058222.
%K nonn,easy,nice,tabf
%O 0,2
%A _N. J. A. Sloane_, Dec 02 2000
|
