This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A215022 NegaFibonacci representation code for n. 7
 0, 1, 100, 101, 10010, 10000, 10001, 10100, 10101, 1001010, 1001000, 1001001, 1000010, 1000000, 1000001, 1000100, 1010010, 1010010, 1010000, 1010001, 1010100, 1010101, 100101010, 100101000, 100101001, 100100010, 100100000, 100100001, 100100100, 100100101 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Let F_{-n} be the negative Fibonacci numbers (as defined in the first comment in A039834): F_{-1}=1, F_{-2}=-1, F_{-3}=2, F_{-4}=-3, F_{-5}=5, ..., F_{-n}=(-1)^(n-1)F_n. Every integer has a unique representation as n = Sum_{k=1..r} c_k F_{-k} for some r, where the c_k are 0 or 1 and no two adjacent c's are 1. Then a(n) is the concatenation c_r ... c_3 c_2 c_1. REFERENCES D. E. Knuth, The Art of Computer Programming, Vol. 4A, Section 7.1.3, p. 169. LINKS Charles R Greathouse IV, Table of n, a(n) for n = 0..1000 EXAMPLE 4 = 5 - 1 = F_{-5} + F_{-2}, so a(4) = 10010. PROG (PARI) a(n)=if(n<2, return(n)); my(s=1, k=1, v); while(s

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

Last modified January 20 14:40 EST 2019. Contains 319333 sequences. (Running on oeis4.)