A316716 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.

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, 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, 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

Offset

0,6

Comments

The number of 1s and 3s in A316713(n) is given in A316715 and A316717, respectively.

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) = number of 2s in A316713(n), that is the number of As in the tribonacci ABC-representation of n >= 0.

Example

See column #(2) of A316713.

Crossrefs

Cf. A278040, A316713, A316714, A316715, A316717.

Sequence in context: A361854 A292475 A329903 * A145462 A159934 A229204

Adjacent sequences: A316713 A316714 A316715 * A316717 A316718 A316719

Keyword

nonn,easy

Author

Wolfdieter Lang, Sep 11 2018

Status

approved