This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A322413 #12 Oct 06 2019 09:28:49 %S A322413 3,16,27,40,47,60,71,84,97,108,121,128,141,152,165,176,189,196,209, %T A322413 220,233,246,257,270,277,290,301,314,321,334,345,358,371,382,395,402, %U A322413 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 %N A322413 Compound tribonacci sequence with a(n) = A278041(A278039(n)), for n >= 0. %C A322413 (a(n+1)) = A319970(n)-1 = A003146(A003144(n))-1, the corresponding classical compound tribonacci sequence. - _Michel Dekking_, Apr 03 2019 %C A322413 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 %F A322413 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). %Y A322413 Cf. A278039, A278040, A278041, A322412. %Y A322413 Cf. A003144, A003145, A003146. %K A322413 nonn,easy %O A322413 0,1 %A A322413 _Wolfdieter Lang_, Jan 02 2019