The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #13 Dec 06 2022 09:49:55
%S 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,
%T 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,
%U 3,3,3,4,3,3,3,2
%N Minimal number of (non-consecutive) Fibonacci numbers needed to get n by addition and subtraction.
%H <a href="/index/Com#complexity">Index to sequences related to the complexity of n</a>
%e a(50) = 2 because 50 is not a Fibonacci number, but 50 = 55 - 5. - _Sean A. Irvine_, Sep 08 2022
%Y Cf. A000045, A007895, A105446.
%K nonn
%O 1,4
%A _Floor van Lamoen_, Jan 15 2001
%E a(50) corrected by _Sean A. Irvine_, Sep 08 2022