|
%I #28 Jan 21 2018 09:36:22
%S 0,1,2,2,3,3,3,4,5,3,4,5,3,4,5,5,6,3,4,5,5,6,3,4,5,5,6,6,6,7,8,3,4,5,
%T 5,6,6,6,7,8,3,4,5,5,6,6,6,7,8,6,7,8,6,7,8,8,9,3,4,5,5,6,6,6,7,8,6,7,
%U 8,6,7,8,8,9,3,4,5,5,6,6,6,7,8,6,7,8,6,7,8,8,9,6,7,8,8,9,6,7,8,8,9,9,9,10,11
%N Image of 0 under repeated application of the morphism phi = {x -> x,x+1,x+2 if x mod 3 = 0; x -> x+1 if x mod 3 = 1 or 2, for x = 0,1,2,3,...}.
%C An analog of A104324 when "Fibonacci" is replaced with "tribonacci".
%C From _Kerry Mitchell_, Jul 01 2017: (Start)
%C This is the limit of a series of iterations. The length of each iteration is given by A000213, beginning with the second term of that sequence (1, 3, 5, 9, 17, etc.):
%C 0
%C 0, 1, 2
%C 0, 1, 2, 2, 3
%C 0, 1, 2, 2, 3, 3, 3, 4, 5
%C 0, 1, 2, 2, 3, 3, 3, 4, 5, 3, 4, 5, 3, 4, 5, 5, 6
%C etc.
%C When written in blocks this way, each subsequent block is the concatenation of the previous block, the third-previous block with each term incremented by 3, and the second-previous block, with each term incremented by 3. (End)
%D Kerry Mitchell, Posting to Sequence Fans Mailing List, Jun 30 2017
%H Kerry Mitchell, <a href="/A288577/b288577.txt">Table of n, a(n) for n = 0..13744</a>
%t SubstitutionSystem[{x_ -> If[Mod[x, 3] == 0, {x, x+1, x+2}, {x+1}]}, {0}, 7] // Last (* _Jean-François Alcover_, Jan 21 2018 *)
%Y Cf. A104324.
%K nonn
%O 0,3
%A _N. J. A. Sloane_, Jul 01 2017
%E More terms from _Kerry Mitchell_, Jul 01 2017
|
