|
|
A103269
|
|
Apply the tribonacci morphism 1 -> {1, 2}, 2 -> {1, 3}, 3 -> {1} n times to 1, and concatenate the resulting string.
|
|
7
|
|
|
1, 12, 1213, 1213121, 1213121121312, 121312112131212131211213, 12131211213121213121121312131211213121213121, 121312112131212131211213121312112131212131211213121121312121312112131213121121312
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
The number of letters in the n-th iteration is tribonacci(n+3) (that is, A000073(n+3)).
|
|
LINKS
|
Elena Barcucci, Luc Belanger and Srecko Brlek, On tribonacci sequences, Fib. Q., 42 (2004), 314-320. See T on page 315.
S. Ito and M. Kimura, On Rauzy fractal, Japan J. Indust. Appl. Math. 8 (1991) 461-486.
|
|
MATHEMATICA
|
FromDigits /@ NestList[ Flatten[ # /. {1 -> {1, 2}, 2 -> {1, 3}, 3 -> 1}] &, {1}, 7]
(* Second program: *)
FromDigits /@ SubstitutionSystem[{1 -> {1, 2}, 2 -> {1, 3}, 3 -> {1}}, {1}, 7] (* Jean-François Alcover, Nov 12 2018 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|