A322413 Compound tribonacci sequence with a(n) = A278041(A278039(n)), for n >= 0.

3, 16, 27, 40, 47, 60, 71, 84, 97, 108, 121, 128, 141, 152, 165, 176, 189, 196, 209, 220, 233, 246, 257, 270, 277, 290, 301, 314, 321, 334, 345, 358, 371, 382, 395, 402, 415, 426, 439, 450, 463, 470, 483, 494, 507, 520, 531, 544, 551, 564, 575, 588, 601, 612, 625, 632, 645, 656, 669, 680, 693

Offset: 0

Author

Wolfdieter Lang, Jan 02 2019

Keywords

• nonn
• easy

Comments

(a(n+1)) = A319970(n)-1 = A003146(A003144(n))-1, the corresponding classical compound tribonacci sequence. - Michel Dekking, Apr 03 2019

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

Crossrefs

Cf. A278039, A278040, A278041, A322412.

Cf. A003144, A003145, A003146.

Formula

a(n) = C(B(n)) = C(B(n) + 1) - 7 = 2*(A(n) + B(n)) + n + 1, for n >= 0, where A = A278040, B = A278039 and C = A278041. For a proof see the W. Lang link in A278040, Proposition 9, eq. (55).