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 A322414 #13 Oct 06 2019 09:28:49 %S A322414 23,67,104,148,172,216,253,297,341,378,422,446,490,527,571,608,652, %T A322414 676,720,757,801,845,882,926,950,994,1031,1075,1099,1143,1180,1224, %U A322414 1268,1305,1349,1373,1417,1454,1498,1535,1579,1603,1647,1684,1728,1772,1809,1853,1877,1921,1958,2002,2046,2083,2127,2151,2195,2232,2276,2313,2357 %N A322414 Compound tribonacci sequence with a(n) = A278041(A278041(n)), for n >= 0. %C A322414 (a(n+1)) = A319972(n)-1 = A003146(A003146(n))-1, the corresponding classical compound tribonacci sequence. - _Michel Dekking_, Apr 04 2019 %C A322414 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 A322414 a(n) = C(C(n)) = C(C(n) + 1) - 4 = 7*A(n) + 6*B(n) + 4*(n + 4), for n >= 0, where A = A278040, B = A278039 and C = A278041. For a proof see the W. Lang link in A278040, Proposition 9, eq. (56). %Y A322414 Cf. A278039, A278040, A278041, A322413. %Y A322414 Cf. A003144, A003145, A003146. %K A322414 nonn,easy %O A322414 0,1 %A A322414 _Wolfdieter Lang_, Jan 02 2019