The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 5
 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 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 See A316713, the column Length(a(n)). CROSSREFS Cf. A316713, A316715, A316716, A316717. Sequence in context: A303581 A216647 A072645 * A135817 A122060 A088939 Adjacent sequences:  A316711 A316712 A316713 * A316715 A316716 A316717 KEYWORD nonn,base,easy AUTHOR Wolfdieter Lang, Sep 11 2018 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 14 05:51 EDT 2021. Contains 345018 sequences. (Running on oeis4.)