login
A275992
Number of times n occurs in A022290.
1
1, 1, 1, 2, 2, 1, 2, 2, 2, 2, 1, 3, 3, 2, 2, 3, 3, 2, 2, 3, 3, 1, 3, 3, 3, 3, 2, 4, 4, 2, 3, 3, 3, 3, 2, 4, 4, 2, 3, 3, 3, 3, 1, 4, 4, 3, 3, 5, 4, 3, 3, 5, 5, 2, 4, 4, 4, 4, 2, 5, 5, 3, 3, 4, 4, 3, 3, 5, 5, 2, 4, 4, 4, 4, 2, 5, 5, 3, 3, 4, 5, 3, 3, 4, 4, 1, 4
OFFSET
0,4
COMMENTS
A000119 counts the ways n can be represented as a sum of distinct Fibonacci numbers. A022290 maps binary ordering onto these Fibonacci representations.
A274515 is an analogous sequence applied to A002487.
LINKS
FORMULA
a(n) = A000119(A022290(n)).
CROSSREFS
KEYWORD
nonn
AUTHOR
Max Barrentine, Aug 15 2016
STATUS
approved