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!)
A109180 The set N of numbers such that each positive integer can be written in the form F + n, where F is a Fibonacci number and n in N, in an even number of ways. 0
0, 1, 4, 7, 9, 11, 14, 17, 18, 20, 21, 23, 24, 25, 26, 28, 33, 35, 38, 39, 40, 41, 43, 46, 47, 50, 51, 52, 55, 56, 60, 61, 62, 63, 64, 65, 66, 71, 72, 73, 75, 77, 78, 79, 80, 81, 82, 83, 84, 86, 87, 91, 92, 94, 96, 97, 99, 100, 101, 102, 103, 104, 105, 106, 108, 109, 110, 111, 116 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Table of n, a(n) for n=1..69.

FORMULA

The terms are the exponents in the expansion of 1/S read mod 2 where S = Sum_{k >= 0, k != 2} x^Fibonacci(k).

CROSSREFS

Cf. A108345, A132229, A103651.

Sequence in context: A265140 A288510 A233473 * A025054 A310947 A275834

Adjacent sequences:  A109177 A109178 A109179 * A109181 A109182 A109183

KEYWORD

nonn

AUTHOR

Nadia Heninger and N. J. A. Sloane, Dec 16 2007

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 25 10:01 EST 2022. Contains 350565 sequences. (Running on oeis4.)