Search: id:A026600
Results 1-1 of 1 results found.

%I A026600
%S A026600 1,2,3,2,3,1,3,1,2,2,3,1,3,1,2,1,2,3,3,1,2,1,2,3,2,3,1,2,3,1,3,1,2,1,2,
%T A026600 3,3,1,2,1,2,3,2,3,1,1,2,3,2,3,1,3,1,2,3,1,2,1,2,3,2,3,1,1,2,3,2,3,1,3,
%U A026600 1,2,2,3,1,3,1,2,1,2,3,2,3,1,3,1,2,1,2,3,3,1,2,1,2,3,2,3,1,1,2,3,2,3,1
%N A026600 a(n) is the n-th letter of the infinite word generated from w(1)=1 inductively 
               by w(n)=JUXTAPOSITION{w(n-1),w'(n-1),w"(n-1)}, where w(k) becomes 
               w'(k) by the cyclic permutation 1->2->3->1 and w"(k) = (w')'(k).
%H A026600 Michael Gilleland, <a href="selfsimilar.html">Some Self-Similar Integer 
               Sequences</a>
%F A026600 a(A026601(n)) = 1. a(A026602(n)) = 2. a(A026603(n)) = 3. - Michael Somos 
               Sep 06 2008
%t A026600 Nest[ Flatten[ # /. {1 -> {1, 2, 3}, 2 -> {2, 3, 1}, 3 -> {3, 1, 2}}] 
               &, {1}, 7] (from Robert G. Wilson v Mar 08 2005)
%o A026600 (PARI) {a(n) = if( n<2, n>0, (a((n + 2)\ 3) + n + 1 )%3 + 1)} /* Michael 
               Somos Sep 06 2008 */
%Y A026600 Equals A053838(n-1) + 1. Cf. A026601-A026614.
%Y A026600 Sequence in context: A014836 A085032 A004549 this_sequence A106560 A103431 
               A125928
%Y A026600 Adjacent sequences: A026597 A026598 A026599 this_sequence A026601 A026602 
               A026603
%K A026600 nonn
%O A026600 1,2
%A A026600 Clark Kimberling (ck6(AT)evansville.edu)

Search completed in 0.001 seconds