|
%I #9 Mar 05 2015 13:46:39
%S 0,1,1,0,1,1,1,0,1,1,1,0,1,1,1,1,0,1,0,1,0,1,1,1,1,0,1,1,1,1,0,1,1,1,
%T 1,1,0,1,0,1,1,0,1,1,0,1,0,1,1,1,1,1,0,1,0,1,1,0,1,1,1,1,1,0,1,1,1,1,
%U 1,0,1,1,1,1,1,1,0,1,0,1,0,1,0,1,0,1,1,1,0,1,1,0,1,1,0,1,1,1,0,1,0,1,1,1,1
%N The Fibonacci Champernowne sequence.
%C Uses Fibonacci Maximal notation: headings are (..., 13, 8, 5, 3, 2, 1) filling in terms from the right.
%C Minimal notation fills in from the left. 8 in Fibonacci Maximal = (1011) = (5 + 2 + 1), whereas 8 in Minimal = (1100) = (5 + 3).
%F Write n in Fibonacci Maximal notation and juxtapose.
%e First few segregated Fibonacci terms (0-6) = (0, 1, 10, 11, 101, 110, 111);
%e so the juxtaposed string begins (0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1,...).
%t Flatten[DeleteCases[IntegerDigits[-1 + Range[200], 2], {___, 0, 0, ___}]]
%t (* _Peter J. C. Moses_, Mar 03 2015 *)
%Y Cf. A030190, A181630, A181631.
%K nonn,base
%O 0,1
%A _Gary W. Adamson_, Nov 02 2010
|
