Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A157238
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A157238
%S A157238 0,1,0,0,1,1,0,1,0,0,1,0,1,1,0,0,1,0,0,0,1,1,0,1,0,0,1,1,0,0,0,1,0,0,1,
%T A157238 1,0,1,0,0,1,0,1,1,0,0,1,0,0,0,1,1,0,1,0,0,1,1,0,1,1,1,0,0,1,0,1,1,0,0,
%U A157238 1,1,1,0,1,1,0,0,1,0,1,1,0,1,0,0,1,1,0,1,1,1,0,0,1,0,1,1,0,0
%N A157238 0-1 sequence generated by starting with a 0, and then by using whichever 
               of 0, 1 will result in the shortest sequence repeated at the end.
%e A157238 a(6)=1 as 0,1,0,0,1,1 has a longest repeated sequence of length 1 at 
               the end, whereas 0,1,0,0,1,0 has a longest repeated sequence of length 
               3 at the end. Similarly a(7)=0 since 0,1,0,0,1,1,0 has a longest 
               repeated sequence of length 0 at the end.
%o A157238 (Python)
%o A157238 .x = [0]
%o A157238 .while (len(x) < 1000):
%o A157238 ..t = x[ -1]
%o A157238 ..z = 1
%o A157238 ..while (2*z+1 <= len(x)):
%o A157238 ...if (x[ -z:] == x[ -(2*z+1):-(z+1)]):
%o A157238 ....t = x[ -(z+1)]
%o A157238 ...z += 1
%o A157238 ..x += [1-t]
%Y A157238 Sequence in context: A084091 A080846 A082401 this_sequence A059448 A156259 
               A038219
%Y A157238 Adjacent sequences: A157235 A157236 A157237 this_sequence A157239 A157240 
               A157241
%K A157238 nonn
%O A157238 1,1
%A A157238 Luke Pebody (luke.pebody(AT)gmail.com), Feb 25 2009

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 4 23:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research