|
%I #20 Mar 07 2022 07:53:58
%S 0,1,0,1,3,2,0,2,3,1,5,4,0,1,3,2,6,7,5,4,0,2,3,7,6,4,5,1,9,8,0,1,3,7,
%T 5,4,6,2,10,11,9,8,0,1,3,2,6,7,5,4,12,13,9,11,10,8,0,1,3,2,6,4,5,7,15,
%U 11,9,13,12,14,10,8,0,2,3,7,5,4,6,14,10,8,12,13,15,11,9,1,17,16
%N Lowest canonical Gray cycles of length 2n.
%C See A236602 for definitions regarding canonical Gray sequences (CGC). The CGC's of a given length can be sorted 'lexically'; for example, the CGC {0 1 5 4 6 7 3 2} precedes {0 1 5 7 3 2 6 4}. This sequence is then the flattened triangular table of the terms of the lowest CGC for each even length L, where L = 2*<row index>.
%C Note: zero unequivocally marks the start of each CGC.
%H Martin Ehrenstein, <a href="/A236603/b236603.txt">Table of n, a(n) for n = 1..1056</a> (first 306 terms from Stanislav Sykora)
%H Martin Ehrenstein, <a href="/A236603/a236603_1.txt">Triangle for A236603</a> (first 17 rows from Stanislav Sykora)
%H Stanislav Sykora, <a href="http://dx.doi.org/10.3247/SL5Math14.001">On Canonical Gray Cycles</a>, Stan's Library, Vol.V, January 2014, DOI: 10.3247/SL5Math14.001
%e L CGC
%e 2 0, 1
%e 4 0, 1, 3, 2
%e 6 0, 2, 3, 1, 5, 4
%e 8 0, 1, 3, 2, 6, 7, 5, 4
%e 10 0, 2, 3, 7, 6, 4, 5, 1, 9, 8
%Y Cf. A236602 (CGC counts).
%K nonn,tabf,hard
%O 1,5
%A _Stanislav Sykora_, Feb 01 2014
|
