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

Author

Floor van Lamoen, Jan 15 2001

Keywords

• nonn

Examples

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

Links

• Index to sequences related to the complexity of n

Crossrefs

Cf. A000045, A007895, A105446.

Extensions

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