|
Search: id:A079336
|
|
|
| A079336 |
|
A repetition-resistant sequence. |
|
+0
6
|
|
| 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Unsolved problem: is every finite binary sequence a segment of a?
|
|
REFERENCES
|
C. Kimberling, Problem 2289, Crux Mathematicorum 23 (1997) 501.
|
|
LINKS
|
C. Kimberling, Unsolved Problems and Rewards.
|
|
FORMULA
|
a(n+1)=0 if and only if (a(1), a(2), ..., a(n), 1), but not (a(1), a(2), ..., a(n), 0), has greater length of longest repeated segment than (a(1), a(2), ..., a(n)) has.
|
|
EXAMPLE
|
a(8)=1 because (0,1,1,0,0,1,0,0) has repeated segment (1,0,0) of length 3, whereas (0,1,1,0,0,1,0,1) has no repeated segment of length 3.
|
|
CROSSREFS
|
Cf. A079101, A079136, A079335, A079337, A079338.
Sequence in context: A076182 A010058 A140591 this_sequence A057215 A029691 A053866
Adjacent sequences: A079333 A079334 A079335 this_sequence A079337 A079338 A079339
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu), Jan 03 2003
|
|
|
Search completed in 0.002 seconds
|
