Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #13 Feb 06 2019 12:31:33
%S 2,3,1,2,3,3,1,2,3,2,3,1,2,3,1,2,3,2,3,1,2,3,3,1,2,3,2,3,1,2,3,3,1,2,
%T 3,2,3,1,2,3,1,2,3,2,3,1,2,3,3,1,2,3,2,3,1,2,3,2,3,1,2,3,3,1,2,3,2,3,
%U 1,2,3,1,2,3,2,3,1,2,3,3,1,2,3,2,3,1,2,3,1,2,3,2,3
%N A ternary tribonacci sequence: define the morphism f: 1 -> 2, 2 -> 3, 3 -> 1,2,3; let S[k] be result of applying f k times to 1, for k =- 0,1,2,...; sequence gives limit S[3k+1] as k -> oo.
%H N. J. A. Sloane, <a href="/A305390/b305390.txt">Table of n, a(n) for n = 0..25280</a>
%Y The three sequence A305389, A305390, A305391 together give the limiting forms of the rows of A059832.
%Y Used by A107793.
%K nonn
%O 0,1
%A _N. J. A. Sloane_, Jun 21 2018