|
%I #6 May 09 2016 01:21:36
%S 1,3,2,3,4,4,2,4,3,4,5,4,6,4,2,4,4,3,4,4,5,5,5,5,4,6,6,4,6,4,2,4,4,5,
%T 5,3,4,4,4,5,4,5,6,5,6,5,5,5,5,4,4,6,7,6,7,5,4,6,6,4,6,4,2,4,4,4,5,5,
%U 6,5,5,4,3,4,5,4,6,4,4,5,5,4,5,5,5,6,6,6,6,6,6,5,6,5,5,5
%N Number of distinct Fibonacci numbers among the contiguous substrings of the binary digits of n.
%H Marko Riedel, <a href="/A272886/a272886.maple.txt">Maple program to compute sequence.</a>
%e a(53) = 7 because 53=(110101)_2 which contains (0)_2 = 0, (1)_2 = 1, (10)_2 = 2, (11)_2 = 3, (101)_2 = 5, (1101)_2 = 13 and (10101)_2 = 21. The one digit only contributes once as do two and zero.
%Y Cf. A000045, A078822, A272851, A272852.
%K nonn
%O 1,2
%A _Marko Riedel_, May 08 2016
|
