A058978 Minimal number of (non-consecutive) Fibonacci numbers needed to get n by addition and subtraction.

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

Links

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

Index to sequences related to the complexity of n

Example

a(50) = 2 because 50 is not a Fibonacci number, but 50 = 55 - 5. - Sean A. Irvine, Sep 08 2022

Crossrefs

Cf. A000045, A007895, A105446.

Sequence in context: A238303 A023575 A215113 * A105446 A367817 A264998

Adjacent sequences: A058975 A058976 A058977 * A058979 A058980 A058981

Keyword

nonn

Author

Floor van Lamoen, Jan 15 2001

Extensions

a(50) corrected by Sean A. Irvine, Sep 08 2022

Status

approved