A103269 Apply the tribonacci morphism 1 -> {1, 2}, 2 -> {1, 3}, 3 -> {1} n times to 1, and concatenate the resulting string.
1, 12, 1213, 1213121, 1213121121312, 121312112131212131211213, 12131211213121213121121312131211213121213121, 121312112131212131211213121312112131212131211213121121312121312112131213121121312
Offset: 0
Keywords
Links
- N. J. A. Sloane, Table of n, a(n) for n = 0..10 (shortened by _N. J. A. Sloane_, Jan 18 2019)
- Elena Barcucci, Luc Belanger and Srecko Brlek, On tribonacci sequences, Fib. Q., 42 (2004), 314-320. See T on page 315.
- Julien Cassaigne, Sebastien Ferenczi, and Luca Q. Zamboni, Imbalances in Arnoux-Rauzy sequences, Annales de l'institut Fourier, 50 (2000), 1265-1276.
- David Damanik and Luca Q. Zamboni, Arnoux-Rauzy Subshifts: Linear Recurrence, Powers and Palindromes, arXiv:math/0208137 [math.CO], 2002.
- C. Holton and L. Q. Zamboni, Directed Graphs and Substitutions, Theory Comput. Systems, 34 (2001) 545-564
- S. Ito and M. Kimura, On Rauzy fractal, Japan J. Indust. Appl. Math. 8 (1991) 461-486.
- A. Messaoudi, Propriétes arithmétiques et dynamiques du fractal de Rauzy, J. Th. Nombres Bordeaux, 10 (1998) 195-224.
- Gérard Rauzy, Nombres algébriques et substitutions, Bull. Soc. Math. France, 110 (1982), 147-178.
- Bo Tan and Zhi-Ying Wen, Some properties of the Tribonacci sequence, European Journal of Combinatorics, 28 (2007) 1703-1719. See A_n.
- Index entries for sequences that are fixed points of mappings
Crossrefs
Programs
-
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 *)
Extensions
Definition edited by N. J. A. Sloane, Aug 06 2018
Comments