%I #15 Jan 16 2019 04:51:45
%S 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 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 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 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 The number of 1s and 3s in A316713(n) is given in A316715 and A316717, respectively.
%H 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 a(n) = number of 2s in A316713(n), that is the number of As in the tribonacci ABC-representation of n >= 0.
%e See column #(2) of A316713.
%Y Cf. A278040, A316713, A316714, A316715, A316717.
%K nonn,easy
%O 0,6
%A _Wolfdieter Lang_, Sep 11 2018