login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A020912 Number of terms in base 4 representation of n-th Fibonacci number. 1
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
FORMULA
a(n) = A110591(A000045(n)). - R. J. Mathar, Feb 18 2008
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 *)
CROSSREFS
Sequence in context: A104581 A261916 A113675 * A194990 A231153 A330557
KEYWORD
nonn,base,easy
AUTHOR
EXTENSIONS
More terms from R. J. Mathar, Feb 18 2008
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 29 04:19 EDT 2024. Contains 372097 sequences. (Running on oeis4.)