|
%I #10 Aug 02 2015 21:13:04
%S 1,1,1,1,2,2,2,3,3,3,4,4,4,5,5,5,6,6,7,7,7,8,8,8,9,9,9,10,10,10,11,11,
%T 11,12,12,12,13,13,13,14,14,14,15,15,16,16,16,17,17,17,18,18,18,19,19,
%U 19,20,20,20,21,21,21,22,22,22,23,23,24,24,24,25,25,25,26,26,26,27,27
%N Number of terms in base 4 representation of n-th Fibonacci number.
%F a(n) = A110591(A000045(n)). - _R. J. Mathar_, Feb 18 2008
%p A020912 := proc(n) nops(convert(combinat[fibonacci](n),base,4)) ; end: seq(A020912(n),n=1..120) ; # _R. J. Mathar_, Feb 18 2008
%t Length/@IntegerDigits[Fibonacci[Range[80]],4] (* _Harvey P. Dale_, Jul 27 2011 *)
%K nonn,base,easy
%O 1,5
%A _Clark Kimberling_
%E More terms from _R. J. Mathar_, Feb 18 2008
|
