A316714 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A316714

a(n) is the number of digits of A316713(n). This is the number of A, B and C sequences used in the tribonacci ABC-representation of n >= 0.

1, 2, 3, 2, 4, 3, 3, 5, 4, 4, 3, 4, 3, 6, 5, 5, 4, 5, 4, 4, 5, 4, 4, 3, 7, 6, 6, 5, 6, 5, 5, 6, 5, 5, 4, 5, 4, 6, 5, 5, 4, 5, 4, 4, 8, 7, 7, 6, 7, 6, 6, 7, 6, 6, 5, 6, 5, 7, 6, 6, 5, 6, 5, 5, 6, 5, 5, 4, 7, 6, 6, 5, 6, 5, 5, 6, 5, 5, 4, 5, 4, 9, 8, 8, 7, 8, 7, 7, 8, 7, 7, 6, 7, 6, 8, 7, 7, 6, 7, 6, 6

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,2

COMMENTS

The number of 1's, 2's and 3's in the representation of n, given in A316713(n), is given in A316715(n), A316716(n) and A316717(n).

LINKS

Table of n, a(n) for n=0..100.

Wolfdieter Lang, The Tribonacci and ABC Representations of Numbers are Equivalent, arXiv preprint arXiv:1810.09787 [math.NT], 2018.

FORMULA

a(n) = length(A316713(n)), n >= 0.

a(n) = A316715(n) + A316716(n) + A316717(n), n >= 0.

EXAMPLE