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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 5
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,6
COMMENTS
The number of 1s and 3s in A316713(n) is given in A316715 and A316717, respectively.
LINKS
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
Sequence in context: A361854 A292475 A329903 * A145462 A159934 A229204
KEYWORD
nonn,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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)