|
%I #12 Jan 16 2019 04:51:49
%S 0,0,0,1,0,0,1,0,0,0,1,1,1,0,0,0,1,0,0,1,1,1,1,2,0,0,0,1,0,0,1,0,0,0,
%T 1,1,1,1,1,1,2,1,1,2,0,0,0,1,0,0,1,0,0,0,1,1,1,0,0,0,1,0,0,1,1,1,1,2,
%U 1,1,1,2,1,1,2,1,1,1,2,2,2,0,0,0,1,0,0,1,0,0,0,1,1,1,0,0,0,1,0,0,1
%N a(n) is the number of 3s in A316713(n). That is, a(n) is the number of C-sequences (A278041) used in the tribonacci ABC-representation of n >= 0.
%C The number of 1s and 2s in A316713(n) is given in A316715 and A316716, 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 3s in A316713(n), that is the number of Cs in the tribonacci ABC-representation of n >= 0.
%e See column #(3) in A316713.
%Y Cf. A316713, A316714, A316715, A316716.
%K nonn
%O 0,24
%A _Wolfdieter Lang_, Sep 11 2018
|
