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!)
A114477 Smallest Fibonacci number with Hamming weight n (i.e., smallest number with exactly n ones when written in binary), or -1 if no such number exists. 1

%I #14 Aug 09 2018 21:20:08

%S 0,1,3,13,89,55,377,1597,987,121393,39088169,28657,514229,3524578,

%T 24157817,1134903170,102334155,165580141,701408733,2504730781961,

%U 956722026041,1836311903,139583862445,6557470319842,591286729879,17167680177565,4052739537881,806515533049393

%N Smallest Fibonacci number with Hamming weight n (i.e., smallest number with exactly n ones when written in binary), or -1 if no such number exists.

%C a(n) = MIN{A000045(k): A000120(A000045(k)) = n}.

%C Among the first 10^5 Fibonacci numbers, none have Hamming weight 44, 45, 61, 62, 76, 92, or 95. - _T. D. Noe_, Jun 25 2007

%t a[ n_ ] := Module[ {}, k = 0; While[ Not[ Plus @@ IntegerDigits[ Fibonacci[ k ]S, 2 ] == n ], k++ ]; Fibonacci[ k ] ]; Table[ a[ i ], {i, 0, 40} ] (* _Stefan Steinerberger_ *)

%K nonn,base

%O 0,3

%A _Jonathan Vos Post_, Jun 24 2007

%E Extended by _Stefan Steinerberger_, Jun 25 2007

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 March 28 11:59 EDT 2024. Contains 371254 sequences. (Running on oeis4.)