|
| |
|
|
A004685
|
|
Fibonacci numbers written in base 2.
|
|
6
| |
|
|
0, 1, 1, 10, 11, 101, 1000, 1101, 10101, 100010, 110111, 1011001, 10010000, 11101001, 101111001, 1001100010, 1111011011, 11000111101, 101000011000, 1000001010101, 1101001101101, 10101011000010, 100010100101111
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,4
|
|
|
LINKS
| Wayne State University College of Engineering, Engineering Bits & Bytes: The Fibonacci Puzzle, (Video, this sequence is looped through in 16-bit words close to the beginning and again at the end).
|
|
|
FORMULA
| a(n) = A007088(A000045(n)). [From Jonathan Vos Post (jvospost3(AT)gmail.com), Aug 24 2010]
|
|
|
MATHEMATICA
| Table[FromDigits[IntegerDigits[Fibonacci[n], 2]], {n, 0, 30}] (* Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Apr 14 2006 *)
|
|
|
CROSSREFS
| Sequence in context: A004676 A124387 A171796 * A171000 A041216 A094026
Adjacent sequences: A004682 A004683 A004684 * A004686 A004687 A004688
|
|
|
KEYWORD
| nonn,easy,base
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
