|
%I #6 Mar 30 2012 16:52:03
%S 1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,2,3,1,1,1,1,3,46,4,1,1,1
%N Triangle read by rows: number of genlex Gray cycles on subcubes that use a certain restricted set of transformations.
%C See Knuth Vol. 4A page 737 for precise definition.
%D D. E. Knuth, The Art of Computer Programming, vol. 4A, Combinatorial Algorithms, Section 7.2.1.3 (p. 737).
%e Triangle begins: 1
%e 1 1
%e 1 1 1
%e 1 1 1 1
%e 1 2 1 1 1
%e 1 2 3 1 1 1
%e 1 3 46 4 1 1 1
%e ...
%Y Cf. A194672.
%K nonn,tabl,more
%O 0,12
%A _N. J. A. Sloane_, Sep 01 2011
|
