login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079336 A repetition-resistant sequence. 5
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; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Unsolved problem: is every finite binary sequence a segment of a?

REFERENCES

C. Kimberling, Problem 2289, Crux Mathematicorum 23 (1997) 501.

LINKS

Table of n, a(n) for n=1..105.

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: A010058 A140591 A203568 * A057215 A029691 A209229

Adjacent sequences:  A079333 A079334 A079335 * A079337 A079338 A079339

KEYWORD

nonn

AUTHOR

Clark Kimberling, Jan 03 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 23 18:36 EDT 2018. Contains 316529 sequences. (Running on oeis4.)