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”).
%I #37 Feb 22 2022 11:49:16
%S 1,2,7,3,4,15,24,5,6,14,10,35,122,36,37,11,61,8,9,21,22,34,23,53,54,
%T 184,185,55,56,84,126,16,17,136,311,12,13,20,48,32,33,113,51,392,78,
%U 52,79,119,405,80,81,277,278,414,621,82,83,283,125,425,191,2166,288
%N Irregular triangle read by rows: a(n) is the n-th term of a truncated Kolakoski tree.
%C Construct a tree with these rules: The root node is labeled 1. Children of odd indices are labeled 2. Children of even indices are labeled 1. Nodes labeled 1 have one child. Nodes labeled 2 have two children. At this point, the values of the n-th row comprise the digits in A111081(n). Replace each node labeled 2 with the positive integers in breadth-first order. Remove all nonbranching nodes.
%H Rémy Sigrist, <a href="/A350505/b350505.txt">Table of n, a(n) for n = 1..5000</a>
%H Rémy Sigrist, <a href="/A350505/a350505.png">Illustration of the construction</a>
%H Rémy Sigrist, <a href="/A350505/a350505.txt">C++ program</a>
%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%e Triangle begins:
%e 1;
%e 2, 7;
%e 3, 4, 15, 24;
%e 5, 6, 14, 10, 35, 122, 36, 37;
%e ...
%o (C++) See Links section.
%Y Inverse is A350506.
%Y Cf. A111081.
%K nonn,look,tabf
%O 1,2
%A _John-Vincent Saddic_, Jan 02 2022