|
%I #18 Feb 06 2019 16:22:56
%S 1,2,1,3,1,2,4,2,1,3,5,1,2,3,4,6,2,1,3,4,5,7,3,1,2,4,5,6,8,4,2,1,3,5,
%T 6,7,9,1,2,3,4,5,6,7,8,10,2,1,3,4,5,6,7,8,9,11,3,1,2,4,5,6,7,8,9,10,
%U 12,4,2,1,3,5,6,7,8,9,10,11,13,5,1,2,3,4,6,7,8,9,10,11,12
%N Triangle read by rows: The first integer in each row, a(n,1) = n. a(n,m) = the smallest positive integer not yet occurring in row n such that |a(n,m)-a(n,m-1)| = a power of 2, for each m where 1 < m <= n.
%H Michael De Vlieger, <a href="/A175344/b175344.txt">Table of n, a(n) for n = 1..11325</a> (1 <= n <= 150)
%e Triangle begins:
%e 1
%e 2 1
%e 3 1 2
%e 4 2 1 3
%e 5 1 2 3 4
%e 6 2 1 3 4 5
%e 7 3 1 2 4 5 6
%e 8 4 2 1 3 5 6 7
%e 9 1 2 3 4 5 6 7 8
%e 10 2 1 3 4 5 6 7 8 9
%e 11 3 1 2 4 5 6 7 8 9 10
%e 12 4 2 1 3 5 6 7 8 9 10 11
%e ...
%t Table[Block[{a = {n}, m}, Do[k = 1; While[Or[MemberQ[a, k], ! IntegerQ@ Log2@ Abs[k - a[[m - 1]]] ], k++]; AppendTo[a, k], {m, 2, n}]; a], {n, 14}] // Flatten (* _Michael De Vlieger_, Dec 14 2016 *)
%K nonn,tabl
%O 1,2
%A _Leroy Quet_, Apr 17 2010
%E More terms from _Michael De Vlieger_, Dec 14 2016
|
