|
%I #8 Sep 17 2016 12:17:12
%S 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,
%T 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,
%U 5,2,4,4,4,4,2,5,5,3,3,4,5,3,3,4,4,1,4
%N Number of times n occurs in A022290.
%C A000119 counts the ways n can be represented as a sum of distinct Fibonacci numbers. A022290 maps binary ordering onto these Fibonacci representations.
%C A274515 is an analogous sequence applied to A002487.
%H Max Barrentine, <a href="/A275992/b275992.txt">Table of n, a(n) for n = 0..10922</a>
%F a(n) = A000119(A022290(n)).
%Y Cf. A000119, A022290, A274515, A002487.
%K nonn
%O 0,4
%A _Max Barrentine_, Aug 15 2016
|
