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 A245574 #11 May 26 2015 10:44:11 %S A245574 0,1,1,2,2,1,2,2,3,3,1,2,2,3,3,2,3,3,4,4,1,2,2,3,3,2,3,3,4,4,2,3,3,4, %T A245574 4,3,4,4,5,5,2,3,3,4,4,3,4,4,5,5,1,2,2,3,3,2,3,3,4,4,2,3,3,4,4,3,4,4, %U A245574 5,5,2,3,3,4,4,3,4,4,5,5,3,4,4,5,5,4,5,5,6,6,3,4,4,5,5,4,5,5,6,6,2 %N A245574 Minimal coin changing sequence for denominations 1, 2, 5, 10, 20 and 50 cents. %C A245574 a(100) = 2 is the first term where the sequence is different from A057536. - _Colin Barker_, Jul 26 2014 %H A245574 <a href="http://math.stackexchange.com/questions/260404/finding-recurrence-and-an-algorithm-to-represent-it">Coin change problem</a> %Y A245574 Cf. A001299, A011542, A057536. %K A245574 nonn %O A245574 0,4 %A A245574 _Marko Riedel_, Jul 25 2014 %E A245574 More terms from _Colin Barker_, Jul 26 2014 %E A245574 a(0)=0 prepended by _Alois P. Heinz_, May 26 2015