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

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

Offset

0,3

Comments

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

Example

See column #(1) in A316713.

Crossrefs

Cf. A316713, A316714, A316716, A316717.

Sequence in context: A175344 A056951 A130517 * A130212 A133737 A213361

Adjacent sequences: A316712 A316713 A316714 * A316716 A316717 A316718

Keyword

nonn,easy

Author

Wolfdieter Lang, Sep 11 2018

Status

approved