|
%I #13 Apr 30 2019 08:31:20
%S 0,0,0,0,1,0,0,1,1,0,1,0,1,1,1,1,0,0,0,0,1,0,0,1,1,0,1,0,1,1,1,1,0,0,
%T 0,0,1,0,0,1,1,0,1,0,1,1,1,1,0,0,0,0,1,0,0,1,1,0,1,0,1,1,1,1,0,0,0,0,
%U 1,0,0,1,1,0,1,0,1,1,1,1,0,0,0,0,1,0,0,1,1,0,1,0,1,1,1,1,0,0,0
%N Lexicographically earliest de Bruijn cycle of length 16 (repeated indefinitely)
%D N. G. de Bruijn, A combinatorial problem, Koninklijke Nederlandse Akademie v. Wetenschappen 49, 758-764, 1946.
%D S. W. Golomb, Shift-Register Sequences, Holden-Day, San Francisco, 1967, Chap. VI, Section 2.2.
%H Alex Bogomolny, <a href="http://www.cut-the-knot.com/ctk/FromLCarrollToArchimedes.shtml">Lewis Carroll to Archimedes</a>
%H F. R. K. Chung, P. Diaconis and R. L. Graham, <a href="https://doi.org/10.1016/0012-365X(92)90699-G">Universal cycles for combinatorial structures</a>, Discr. Math., 110 (1992), 43-59.
%H Frank Ruskey, <a href="http://combos.org/necklace">Generate Necklaces</a>
%H <a href="/index/Rec#order_16">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
%F a(n) = (1/240)*{16*(n mod 16)+[(n+1) mod 16]+[(n+2) mod 16]+[(n+3) mod 16]-14*[(n+4) mod 16]+16*[(n+5) mod 16]-14*[(n+6) mod 16]+16*[(n+7) mod 16]+[(n+8) mod 16]-14*[(n+9) mod 16]+[(n+10) mod 16]+16*[(n+11) mod 16]-14*[(n+12) mod 16]+[(n+13) mod 16]+[(n+14) mod 16]+[(n+15) mod 16]}.
%F Periodic with period 16.
%e The period is 0000100110101111.
%t LinearRecurrence[{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1},{0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1},99] (* _Ray Chandler_, Aug 26 2015 *)
%Y Cf. A169671, A169672, A169673, A169674.
%K nonn
%O 0,1
%A _N. J. A. Sloane_, Mar 03 2003
|
