login
This site is supported by donations to The OEIS Foundation.

 

Logo

The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A004685 Fibonacci numbers written in base 2. 22
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; text; internal format)
OFFSET

0,4

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

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, Aug 24 2010]

MATHEMATICA

Table[FromDigits[IntegerDigits[Fibonacci[n], 2]], {n, 0, 30}] (* Stefan Steinerberger, Apr 14 2006 *)

PROG

(PARI) a(n)=subst(Pol(binary(fibonacci(n))), 'x, 10) \\ Charles R Greathouse IV, Feb 03 2014

CROSSREFS

Sequence in context: A004676 A124387 A171796 * A171000 A222365 A041216

Adjacent sequences:  A004682 A004683 A004684 * A004686 A004687 A004688

KEYWORD

nonn,easy,base

AUTHOR

N. J. A. Sloane.

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified May 25 21:22 EDT 2017. Contains 287059 sequences.