login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A020899 Odd number of terms in Zeckendorf representation of n (write n as a sum of non-consecutive distinct Fibonacci numbers). 12

%I

%S 1,2,3,5,8,12,13,17,19,20,21,25,27,28,30,31,32,34,38,40,41,43,44,45,

%T 48,49,50,52,55,59,61,62,64,65,66,69,70,71,73,77,78,79,81,84,88,89

%N Odd number of terms in Zeckendorf representation of n (write n as a sum of non-consecutive distinct Fibonacci numbers).

%C A007895(a(n)) mod 2 = 1. - _Reinhard Zumkeller_, Mar 10 2013

%D D. E. Daykin, "Representation of natural numbers as sums of generalized Fibonacci numbers," J. London Math. Soc. 35 (1960) 143-160.

%D C. G. Lekkerkerker, "Voorstelling van natuurlijke getallen door een som van getallen van Fibonacci," Simon Stevin 29 (1952) 190-195.

%D Zeckendorf, E., Repr├ęsentation des nombres naturels par une somme des nombres de Fibonacci ou de nombres de Lucas, Bull. Soc. Roy. Sci. Li├Ęge 41, 179-182, 1972.

%H Reinhard Zumkeller, <a href="/A020899/b020899.txt">Table of n, a(n) for n = 1..10000</a>

%o (Haskell)

%o a020899 n = a020899_list !! (n-1)

%o a020899_list = filter (odd . a007895) [1..]

%o -- _Reinhard Zumkeller_, Mar 10 2013

%K nonn

%O 1,2

%A _Clark Kimberling_

%E Offset corrected by _Reinhard Zumkeller_, Mar 10 2013

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 29 04:42 EDT 2020. Contains 337420 sequences. (Running on oeis4.)