|
|
A255809
|
|
Infinite tree (flattened) generated as follows: generation g(1) = (1); thereafter, putting h = 2^n, each (1,x(2),...,x(h)) in generation g(n) has 1st and 2nd offspring, namely (1,x(2),...,x(h),x(h)+1) and (1,x(2),...,x(h),x(h)+2).
|
|
2
|
|
|
1, 1, 2, 1, 3, 1, 2, 3, 1, 2, 4, 1, 3, 4, 1, 3, 5, 1, 2, 3, 4, 1, 2, 3, 5, 1, 2, 4, 5, 1, 2, 4, 6, 1, 3, 4, 5, 1, 3, 4, 6, 1, 3, 5, 6, 1, 3, 5, 7, 1, 2, 3, 4, 5, 1, 2, 3, 4, 6, 1, 2, 3, 5, 6, 1, 2, 3, 5, 7, 1, 2, 4, 5, 6, 1, 2, 4, 5, 7, 1, 2, 4, 6, 7, 1, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
Generation n consists of 2^(n-1) increasing n-tuples that have maximal gapsize 2.
|
|
LINKS
|
|
|
EXAMPLE
|
generation g(1) = (1);
g(2) = (1,2), (1,3);
g(3) = (1,2,3), (1,2,4), (1,3,4), (1,3,5);
g(4) = (1,2,3,4), (1,2,3,5), (1,2,4,5), (1,2,4,6), (1,3,4,5), (1,3,4,6), (1,3,5,6), (1,3,5,7).
|
|
MATHEMATICA
|
z = 5; t[n_] := t[n] = Join[{{First[#]}}, Rest[#]] &[Sort[Flatten[NestList[Map[Flatten, Transpose[Map[Flatten[#, 1] &, {{#, #}, {1 + Map[Last, #], 2 + Map[Last, #]}}]]] &, 1(*seed*), #], 1]] &[n(*iterations*)]]
Column[Table[t[n], {n, 1, z}]] (* 1st z generations *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|