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

A058978

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

Terms

    a(0) =1a(1) =1a(2) =1a(3) =2a(4) =1a(5) =2a(6) =2a(7) =1a(8) =2a(9) =2a(10) =2a(11) =2a(12) =1a(13) =2a(14) =2a(15) =2a(16) =3a(17) =2a(18) =2a(19) =2a(20) =1a(21) =2a(22) =2a(23) =2a(24) =3a(25) =2a(26) =3a(27) =3a(28) =2a(29) =3

External references