A316715 - OEIS

%I #15 Jan 16 2019 04:51:41

%S 1,1,2,1,3,1,2,4,2,2,1,3,1,5,3,3,2,3,1,2,4,2,2,1,6,4,4,3,4,2,3,4,2,2,

%T 1,3,1,5,3,3,2,3,1,2,7,5,5,4,5,3,4,5,3,3,2,4,2,5,3,3,2,3,1,2,4,2,2,1,

%U 6,4,4,3,4,2,3,4,2,2,1,3,1,8,6,6,5,6,4,5,6,4,4,3,5,3,6,4,4,3,4,2,3

%N a(n) is the number of 1s in A316713(n). That is, a(n) is the number of B-sequences (A278039) used in the tribonacci ABC-representation of n >= 0.

%C The number of 2s and 3s in A316713(n) is given in A316716 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 1s in A316713(n), that is the number of Bs in the tribonacci ABC-representation of n >= 0.

%e See column #(1) in A316713.

%Y Cf. A316713, A316714, A316716, A316717.

%K nonn,easy

%O 0,3

%A _Wolfdieter Lang_, Sep 11 2018