login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A058978
Minimal number of (non-consecutive) Fibonacci numbers needed to get n by addition and subtraction.
2
1, 1, 1, 2, 1, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 3, 2, 2, 2, 1, 2, 2, 2, 3, 2, 3, 3, 2, 3, 2, 2, 2, 1, 2, 2, 2, 3, 2, 3, 3, 2, 3, 3, 3, 3, 2, 3, 3, 2, 3, 2, 2, 2, 1, 2, 2, 2, 3, 2, 3, 3, 2, 3, 3, 3, 3, 2, 3, 3, 3, 4, 3, 3, 3, 2
OFFSET
1,4
EXAMPLE
a(50) = 2 because 50 is not a Fibonacci number, but 50 = 55 - 5. - Sean A. Irvine, Sep 08 2022
CROSSREFS
KEYWORD
nonn
AUTHOR
Floor van Lamoen, Jan 15 2001
EXTENSIONS
a(50) corrected by Sean A. Irvine, Sep 08 2022
STATUS
approved