cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A178992 Ordered list in decimal notation of the subwords (with leading zeros omitted) appearing in the infinite Fibonacci word A005614 (0->1 & 1->10).

This page as a plain text file.
%I A178992 #38 Mar 28 2014 23:42:21
%S A178992 0,1,2,3,5,6,10,11,13,21,22,26,27,43,45,53,54,86,90,91,107,109,173,
%T A178992 181,182,214,218,346,347,363,365,429,437,693,694,726,730,858,859,875,
%U A178992 1387,1389,1453,1461,1717,1718,1750,2774,2778,2906,2907,2923,3435,3437,3501
%N A178992 Ordered list in decimal notation of the subwords (with leading zeros omitted) appearing in the infinite Fibonacci word A005614 (0->1 & 1->10).
%C A178992 The definition mentions the Fibonacci word A005614. Note that the official Fibonacci word is A003849, which would give a different list, namely, the 2's-complement of the present list. - _N. J. A. Sloane_, Jan 12 2011
%D A178992 J.-P. Allouche and J. Shallit, Automatic Sequences, Cambridge Univ. Press, 2003.
%H A178992 T. D. Noe, <a href="/A178992/b178992.txt">Table of n, a(n) for n = 1..1015</a>
%H A178992 T. D. Noe, <a href="/A171676/a171676.txt">Table of n, a(n) for n = 1..1652</a> [The first 1652 terms written in binary, including leading zeros. Not a b-file.]
%e A178992 The Fibonacci word has a minimal complexity, i.e., for any n there are n+1 distinct subwords of length n (see for example Allouche and Shallit).
%e A178992 E.g. for n=1 they are '0' and '1', for n=2 '01', '10' and '11' or, in decimal notation '1','2',and '3'.
%e A178992 Some subwords prefixed with '0' have the same decimal value as shorter ones, but there is no real ambiguity as double zeros do not appear in the infinite Fibonacci word.
%t A178992 iter=8; f=Nest[Flatten[# /. {0 -> {1}, 1 -> {1, 0}}] &, {1}, iter]; u={}; n=1; While[lst={}; k=0; While[num=FromDigits[Take[f, {1, n}+k], 2]; lst=Union[lst, {num}]; Length[lst]<n+1 && k<Length[f]-n, k++]; Length[lst]==n+1, u=Union[u, lst]; n++]; u
%Y A178992 Cf. A003849, A005614, A171676, A179969.
%K A178992 nonn,nice,base
%O A178992 1,3
%A A178992 _Alexandre Losev_, Jan 03 2011
%E A178992 Definition clarified by _N. J. A. Sloane_, Jan 10 2011