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 A322410 #15 Oct 06 2019 09:28:49 %S A322410 1,8,14,21,25,32,38,45,52,58,65,69,76,82,89,95,102,106,113,119,126, %T A322410 133,139,146,150,157,163,170,174,181,187,194,201,207,214,218,225,231, %U A322410 238,244,251,255,262,268,275,282,288,295,299,306,312,319,326,332,339,343,350,356,363,369,376 %N A322410 Compound tribonacci sequence with a(n) = A278040(A278039(n)), for n >= 0. %C A322410 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 A322410 A(B(n)) = A(B(n) + 1) - 4 = A(n) + B(n) + n, for n >= 0, with A = A278040 and B = A278039. For a proof see the W. Lang link in A278040, Proposition 9, eq. (49). %F A322410 a(n+1) = A319967(n)-1 = A003145(A003144(n))-1, the corresponding classical compound tribonacci sequence. - _Michel Dekking_, Apr 04 2019 %Y A322410 Cf. A278039, A278040, A322409. %Y A322410 Cf. A003144, A003145, A003146. %K A322410 nonn,easy %O A322410 0,2 %A A322410 _Wolfdieter Lang_, Jan 02 2019