A003145 Positions of letter b in the tribonacci word abacabaabacababac... generated by a->ab, b->ac, c->a (cf. A092782).
2, 6, 9, 13, 15, 19, 22, 26, 30, 33, 37, 39, 43, 46, 50, 53, 57, 59, 63, 66, 70, 74, 77, 81, 83, 87, 90, 94, 96, 100, 103, 107, 111, 114, 118, 120, 124, 127, 131, 134, 138, 140, 144, 147, 151, 155, 158, 162, 164, 168, 171, 175, 179, 182, 186, 188, 192, 195, 199, 202, 206, 208
Offset: 1
Keywords
References
- Eric Duchêne, Aviezri S. Fraenkel, Vladimir Gurvich, Nhan Bao Ho, Clark Kimberling, Urban Larsson, Wythoff Visions, Games of No Chance, Vol. 5; MSRI Publications, Vol. 70 (2017), pages 101-153.
- N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
Links
- N. J. A. Sloane, Table of n, a(n) for n = 1..10609
- Elena Barcucci, Luc Belanger and Srecko Brlek, On tribonacci sequences, Fib. Q., 42 (2004), 314-320.
- L. Carlitz, R. Scoville and V. E. Hoggatt, Jr., Fibonacci representations of higher order, Fib. Quart., 10 (1972), 43-69. The present sequence is called b.
- F. Michel Dekking, Jeffrey Shallit, and N. J. A. Sloane, Queens in exile: non-attacking queens on infinite chess boards, Electronic J. Combin., 27:1 (2020), #P1.52.
- Eric Duchêne and Michel Rigo, A morphic approach to combinatorial games: the Tribonacci case. RAIRO - Theoretical Informatics and Applications, 42, 2008, pp 375-393. doi:10.1051/ita:2007039. [Also available from Numdam]
- A. J. Hildebrand, Junxian Li, Xiaomin Li, Yun Xie, Almost Beatty Partitions, arXiv:1809.08690 [math.NT], 2018.
- Wolfdieter Lang, The Tribonacci and ABC Representations of Numbers are Equivalent, arXiv preprint arXiv:1810.09787 [math.NT], 2018.
Crossrefs
Programs
-
Maple
M:=17; S[1]:=`a`; S[2]:=`ab`; S[3]:=`abac`; for n from 4 to M do S[n]:=cat(S[n-1], S[n-2], S[n-3]); od: t0:=S[M]: l:=length(t0); t1:=[]; for i from 1 to l do if substring(t0,i..i) = `b` then t1:=[op(t1),i]; fi; od: # N. J. A. Sloane
-
Mathematica
StringPosition[SubstitutionSystem[{"a" -> "ab", "b" -> "ac", "c" -> "a"}, "b", {#}][[1]], "b"][[All, 1]] &@9 (* Michael De Vlieger, Mar 30 2017, Version 10.2, after JungHwan Min at A003144 *)
Formula
It appears that a(n) = floor(n*t^2) + eps for all n, where t is the tribonacci constant A058265 and eps is 0, 1, or 2. See A276799. - N. J. A. Sloane, Oct 28 2016. This is true - see the Dekking et al. paper. - N. J. A. Sloane, Jul 22 2019
Extensions
More terms from Philippe Deléham, Apr 16 2004
Corrected by T. D. Noe and N. J. A. Sloane, Nov 01 2006
Entry revised by N. J. A. Sloane, Oct 13 2016
Comments