cp's OEIS Frontend

Old name was: Compound tribonacci sequence a(n) = A319198(A278041(n)), for n >= 0.

a(n) gives the sum of the entries of the tribonacci word sequence t = A080843 not exceeding t(C(n)), with C(n) = A278041(n).

The nine sequences A308199, A319967, A319968, A322410, A322409, A322411, A322413, A322412, A322414 are based on defining the tribonacci ternary word to start with index 0 (in contrast to the usual definition, in A080843 and A092782, which starts with index 1). As a result these nine sequences differ from the compound tribonacci sequences defined in A278040, A278041, and A319966-A319972. - N. J. A. Sloane, Apr 05 2019

The difference sequence (a(n+1)-a(n)) is equal to a change of alphabet of the tribonacci word t = A092782. The alphabet is {4,4,3}. This follows from the formula a(n) = A278039(n) + 2*n + 3. - Michel Dekking, Oct 05 2019

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.

This sequence gives the positions of the word bab 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 baa, bab and bac give a splitting of the positional sequence of the word ba, and the three sets BA(N), BB(N) and BC(N), give a splitting of the set B(N), where A := A003144, B := A003145, C := A003146. Here N denotes the set of positive integers. - Michel Dekking, Apr 09 2019

This is the Beatty sequence for tau_prime = 2.191487883953118747061354268227517294...,

defined by 1/tau + 1/tau_prime = 1.

Differs from A172278 at n = 162, 209, 256, 303, 324, ...

Note that Beatty sequences do not normally include 0 - see the classic pair A000201, A001950. - N. J. A. Sloane, Oct 19 2018

Note that the tribonacci numbers T = A000073 related to the ternary sequence A080843 lead to the three complementary sequences for the nonnegative integers AT(n) = A278040(n), BT(n) = A278039(n) and CT(n) = A278041(n). - Wolfdieter Lang, Sep 08 2018

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.

This sequence gives the positions of the word cabaa in the tribonacci word t = abacabaa..., fixed point of the morphism a->ab, b->ac, c->a. This follows from the fact that the word baa is always preceded in t by the word ca, and the formula CA = BB-2, where A := A003144, B := A003145, C := A003146. See A319968 for BB. - Michel Dekking, Apr 09 2019

The fact that this sequence is the positional sequence of cabaa in the tribonacci word permits to apply Theorem 5.1. in the paper by Huang and Wen. This gives that the sequence (a(n+1)-a(n)) equals the tribonacci word on the alphabet {a(2)-a(1), a(3)-a(2), a(5)-a(4)} = {13, 11, 7}. - Michel Dekking, Oct 04 2019

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.

This sequence gives the positions of the word cabab in the tribonacci word t = abacabaa..., fixed point of the morphism a->ab, b->ac, c->a. This follows from the fact that the word bab is always preceded in t by the word ca, and the formula CB = BC-2, where A := A003144, B := A003145, C := A003146. See A319969 for BC, the positional sequence of the word bab. - Michel Dekking, Apr 09 2019

Old name was: Compound tribonacci sequence a(n) = A319198(A278040(n)), for n >= 0.

a(n) gives the sum of the entries of the tribonacci word sequence t = A080843 not exceeding t(A(n)), with A(n) = A278040(n).

The numbers that occur twice in this sequence are the numbers in A278039.

The row length L(n) of this irregular triangle is A316714(n), n >= 1.

This representation is based on the complementary and disjoint sets A, B and C given by the sequences A278040, A278039 and A278041, respectively. In the present notation sequences A, B and C are denoted by 1, 0 and 2.

The numbers are represented by iterations of these sequences always starting with B(0) = 0 (in analogy to the Wythoff B sequence in the Fibonacci case). Uniqueness requires that the representations end in A(B(0)) or C(B(0)).

B^[k](0) (k-fold iterations) for k >= 2 are forbidden. One could represent the number 0 by B(0), but this is not done here, because it is found that the ABC-representations of positive numbers is equivalent to the tribonacci representation of positive numbers given in A278038 for n >= 1 (n = 0 is not represented by T(1) = A000073(1) = 0. This representation uses the tribonacci numbers {T(k)}_{k >= 3} = {1, 2, 4, 7, 13, ...} for uniqueness reason).

For this table the operation of sequences A, B and C is denoted by 1, 0 and 2, respectively, and the brackets and the final argument (0) of B(0) are not recorded. E.g., A(B(C(B(0)))) is written as 1020.

Another form of this table is given in A316713 where A, B and C are denoted 2, 1 and 3, respectively.

An equivalent such representation is given by A317206 using different complementary sequences A, B and C, related to our B = A278039, A = A278040, and C = A278041: A(n) = A003144(n) = A278039(n-1) + 1, B(n) = A003145(n) = A278040(n-1) + 1, C(n) = A003146(n) = A278041(n-1) + 1 with n >= 1.

The present representation is the analog to the Wythoff representation of positive numbers (A189921 or A317208) using the Wythoff A and B sequences A000201 and A001950, respectively.

The number length of the ABC-representation of n >= 1 is L(n) = A316714(n). The number of 0's (B's), 1's (A's) and 2's (C's) of the representation of n is A316715, A316716, A316717.