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 A316716 #15 Jan 16 2019 04:51:45 %S A316716 0,1,1,0,1,2,0,1,2,2,1,0,1,1,2,2,1,2,3,1,0,1,1,0,1,2,2,1,2,3,1,2,3,3, %T A316716 2,1,2,0,1,1,0,1,2,0,1,2,2,1,2,3,1,2,3,3,2,1,2,2,3,3,2,3,4,2,1,2,2,1, %U A316716 0,1,1,0,1,2,0,1,2,2,1,0,1,1,2,2,1,2,3,1,2,3,3,2,1,2,2,3,3,2,3,4,2 %N A316716 a(n) is the number of 2s in A316713(n). That is, a(n) is the number of A-sequences (A278040) used in the tribonacci ABC-representation of n >= 0. %C A316716 The number of 1s and 3s in A316713(n) is given in A316715 and A316717, respectively. %H A316716 Wolfdieter Lang, <a href="https://arxiv.org/abs/1810.09787">The Tribonacci and ABC Representations of Numbers are Equivalent</a>, arXiv preprint arXiv:1810.09787 [math.NT], 2018. %F A316716 a(n) = number of 2s in A316713(n), that is the number of As in the tribonacci ABC-representation of n >= 0. %e A316716 See column #(2) of A316713. %Y A316716 Cf. A278040, A316713, A316714, A316715, A316717. %K A316716 nonn,easy %O A316716 0,6 %A A316716 _Wolfdieter Lang_, Sep 11 2018