This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A058978 #13 Dec 06 2022 09:49:55 %S A058978 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 A058978 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 A058978 3,3,3,4,3,3,3,2 %N A058978 Minimal number of (non-consecutive) Fibonacci numbers needed to get n by addition and subtraction. %H A058978 <a href="/index/Com#complexity">Index to sequences related to the complexity of n</a> %e A058978 a(50) = 2 because 50 is not a Fibonacci number, but 50 = 55 - 5. - _Sean A. Irvine_, Sep 08 2022 %Y A058978 Cf. A000045, A007895, A105446. %K A058978 nonn %O A058978 1,4 %A A058978 _Floor van Lamoen_, Jan 15 2001 %E A058978 a(50) corrected by _Sean A. Irvine_, Sep 08 2022