cp's OEIS Frontend

A319972 a(n) = A003146(A003146(n)).

%I A319972 #21 Jan 05 2025 19:51:41
%S A319972 24,68,105,149,173,217,254,298,342,379,423,447,491,528,572,609,653,
%T A319972 677,721,758,802,846,883,927,951,995,1032,1076,1100,1144,1181,1225,
%U A319972 1269,1306,1350,1374,1418,1455,1499,1536,1580,1604,1648,1685,1729,1773,1810,1854
%N A319972 a(n) = A003146(A003146(n)).
%C A319972 By analogy with the Wythoff compound sequences A003622 etc., the nine compounds of A003144, A003145, A003146 might be called the tribonacci compound sequences. They are A278040, A278041, and A319966-A319972.
%C A319972 This sequence gives the positions of the word cabac in the tribonacci word t = abacabaa..., fixed point of the morphism a->ab, b->ac, c->a.  This follows from the fact that the positional sequences of cabaa, cabab and cabac give a splitting of the positional sequence of the word caba (the unique word in t with prefix the letter c), and that the three sets CA(N), CB(N) and CC(N), give a splitting of the set C(N), where A := A003144, B := A003145, C := A003146. Here N is the set of positive integers. - _Michel Dekking_, Apr 09 2019
%H A319972 Rémy Sigrist, <a href="/A319972/b319972.txt">Table of n, a(n) for n = 1..10000</a>
%H A319972 Elena Barcucci, Luc Belanger and Srecko Brlek, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Papers1/42-4/quartbarcucci04_2004.pdf">On tribonacci sequences</a>, Fib. Q., 42 (2004), 314-320. Compare page 318.
%F A319972 a(n) = A003146(A003146(n)).
%F A319972 a(n) = 6*A003144(n) + 7*A003145(n) + 4*n = 7*A278040(n-1) + 6*A278039(n-1) + 4*n + 13, n >= 1. For a proof see the W. Lang link in A278040, Proposition 9, eq. (56). - _Wolfdieter Lang_, Apr 11 2019
%Y A319972 Cf. A003144, A003145, A003146, A003622, A278039, A278040, A278041, and A319966-A319972.
%K A319972 nonn
%O A319972 1,1
%A A319972 _N. J. A. Sloane_, Oct 05 2018
%E A319972 More terms from _Rémy Sigrist_, Oct 16 2018