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 A245588 #8 May 26 2015 11:12:43 %S A245588 0,1,1,2,2,1,2,2,3,3,2,3,3,1,2,2,3,3,2,3,3,4,4,3,4,4,2,3,3,4,4,3,4,4, %T A245588 1,2,2,3,3,2,3,3,4,4,3,4,4,2,3,3,4,4,3,4,4,5,5,4,5,5,3,4,4,5,5,4,5,5, %U A245588 2,3,3,4,4,3,4,4,5,5,4,5,5,3,4,4,5,5,4,5,5,1,2,2,3,3,2,3,3,4,4,3,4,4,2,3,3,4 %N A245588 The minimal number of coins needed to make change for n units in a currency system with coins of value 1,2,5,13,34,89,...,Fibonacci(2k-1). %H A245588 Alois P. Heinz, <a href="/A245588/b245588.txt">Table of n, a(n) for n = 0..10000</a> %e A245588 a(12) = 3 because the minimal number of coins needed to make 12 = 2+5+5 is 3. %Y A245588 Cf. A000045, A089197. %K A245588 nonn %O A245588 0,4 %A A245588 _Colin Barker_, Jul 26 2014 %E A245588 a(0)=0 prepended by _Alois P. Heinz_, May 26 2015