Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096055
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A096055
%S A096055 1,0,1,1,0,1,0,1,0,1,1,0,1,0,1,0,1,1,0,1,0,1,0,1,1,0,1,1,0,1,1,0,1,0,1,
%T A096055 0,1,1,0,1,0,1,0,1,1,0,1,0,1,0,1,1,0,1,0,1,0,1,1,0,1,0,1,0,1,1,0,1,0,1,
%U A096055 0,1,1,0,1,0,1,0,1,1,0,1,1,0,1,1,0,1,0,1,0,1,1,0,1,0,1,0,1,1,0,1,0,1,0
%N A096055 Let {s(i)}, i=0,1,2,... be a sequence of finite sequences with terms 
               s(i)(j), j=1,2,3,... Start with s(0)={1}. Then, for k>0, let s(k)=s(k-1)Us(k-1) 
               if s(k-1)(k)=0, s(k)=s(k-1)U{0}Us(k-1) if s(k-1)(k)=1, where s(i)(j) 
               is the j-th element of s(i) and U denotes concatenation of the terms 
               of the two operands. {a(n)} is the limit of s(k) as k goes to infinity.
%C A096055 Suggested by Leroy Quet Jul 18,2004.
%H A096055 Leroy Quet, <a href="http://www.prism-of-spirals.net/">Home Page</a> 
               (listed in lieu of email address)
%e A096055 Let s(0)={1}. Then
%e A096055 s(1)=s(0)U{0}Us(0)={1,0,1}, since s(0)(1)=1,
%e A096055 s(2)=s(2)Us(2)={1,0,1,1,0,1}, since s(1)(2)=0,
%e A096055 s(3)=s(2)U{0}Us(2)={1,0,1,1,0,1,0,1,0,1,1,0,1}, since s(2)(3)=1, etc.
%Y A096055 Sequence in context: A104974 A024711 A128174 this_sequence A125144 A115198 
               A005614
%Y A096055 Adjacent sequences: A096052 A096053 A096054 this_sequence A096056 A096057 
               A096058
%K A096055 nonn
%O A096055 1,1
%A A096055 John W. Layman (layman(AT)math.vt.edu), Jul 20 2004

    
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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research