|
| |
|
|
A171676
|
|
Ordered list in binary of the subwords (with leading zeros omitted) appearing in the infinite Fibonacci word.
|
|
4
|
|
|
|
0, 1, 10, 11, 101, 110, 1010, 1011, 1101, 10101, 10110, 11010, 11011, 101011, 101101, 110101, 110110, 1010110, 1011010, 1011011, 1101011, 1101101, 10101101, 10110101, 10110110, 11010110, 11011010, 101011010, 101011011, 101101011, 101101101, 110101101, 110110101, 1010110101, 1010110110, 1011010110, 1011011010, 1101011010, 1101011011, 1101101011
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,3
|
|
|
COMMENTS
|
Numbers in A178992 written in base 2.
|
|
|
LINKS
|
Table of n, a(n) for n=1..40.
T. D. Noe, Table of n, a(n) for n = 1..1652 [The first 1652 terms, including leading zeros. Not a b-file.]
|
|
|
CROSSREFS
|
Cf. A003849, A178992, A005614.
Sequence in context: A104326 A205598 A037090 * A118240 A157845 A230297
Adjacent sequences: A171673 A171674 A171675 * A171677 A171678 A171679
|
|
|
KEYWORD
|
base,nonn,easy
|
|
|
AUTHOR
|
N. J. A. Sloane, Jan 07 2011
|
|
|
STATUS
|
approved
|
| |
|
|
