A020912 Number of terms in base 4 representation of n-th Fibonacci number.

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, 11, 12, 12, 12, 13, 13, 13, 14, 14, 14, 15, 15, 16, 16, 16, 17, 17, 17, 18, 18, 18, 19, 19, 19, 20, 20, 20, 21, 21, 21, 22, 22, 22, 23, 23, 24, 24, 24, 25, 25, 25, 26, 26, 26, 27, 27

Offset: 1

Author

Clark Kimberling

Keywords

• nonn
• base
• easy

Programs

Maple

A020912 := proc(n) nops(convert(combinat[fibonacci](n),base,4)) ; end: seq(A020912(n),n=1..120) ; # R. J. Mathar, Feb 18 2008

Mathematica

Length/@IntegerDigits[Fibonacci[Range[80]],4] (* Harvey P. Dale, Jul 27 2011 *)

Formula

a(n) = A110591(A000045(n)). - R. J. Mathar, Feb 18 2008

Extensions

More terms from R. J. Mathar, Feb 18 2008