login
A324473
k appears A278045(k)+1 times.
3
1, 2, 2, 3, 4, 4, 4, 5, 6, 6, 7, 7, 7, 7, 8, 9, 9, 10, 11, 11, 11, 1, 13, 13, 13, 13, 14, 15, 15, 16, 17, 17, 17, 18, 189, 19, 20, 20, 20, 20, 21, 22, 22, 23, 24, 24, 24, 24, 24, 24, 25, 26, 26, 27, 28, 28, 28, 29, 30, 30
OFFSET
1,2
COMMENTS
Each k appears one more times than the number of trailing zeros in the tribonacci representation of n (see A278038).
This is related to the tribonacci representation of n in the same way as A046699 (without its initial term) is related to the binary representation of n and as A316628 is to the Zeckendorf representation of n.
LINKS
Nathan Fox, Trees, Fibonacci Numbers, and Nested Recurrences, Rutgers University Experimental Math Seminar, Mar 07, 2019
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Mar 07 2019
STATUS
approved