login
a(n) = the largest Fibonacci number that when represented in binary is a substring in the binary representation of n.
0

%I #9 Mar 11 2014 01:32:34

%S 1,2,3,2,5,3,3,8,2,5,5,3,13,3,3,8,8,2,3,5,21,5,5,8,3,13,13,3,13,3,3,8,

%T 8,34,8,2,5,3,3,8,5,21,21,5,13,5,5,8,8,3,3,13,21,13,55,8,3,13,13,3,13,

%U 3,3,8,8,8,8,34,34,8,8,8,2,5,5,3,13,3,3,8,8,5,5,21,21,21,21,8,89,13,13,5,13,5,5,8,8,34,8,3

%N a(n) = the largest Fibonacci number that when represented in binary is a substring in the binary representation of n.

%K nonn,base

%O 1,2

%A _Leroy Quet_, Jul 02 2009

%E More terms from _Max Alekseyev_, Jun 18 2011