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 A358012 #34 Nov 08 2022 08:07:08 %S A358012 0,1,2,3,4,1,2,3,4,5,2,3,4,5,6,3,4,5,6,7,4,5,6,7,8,5,6,7,8,9,6,7,8,9, %T A358012 10,7,8,9,10,11,8,9,10,11,12,9,10,11,12,13,10,11,12,13,14,11,12,13,14, %U A358012 15,12,13,14,15,16,13,14,15,16,17,14,15,16,17,18,15,16 %N A358012 Minimal number of coins needed to pay n cents using coins of denominations 1 and 5 cents. %C A358012 Sequence consists of runs of five consecutive integers: 0..4, 1..5, 2..6, 3..7, etc. %H A358012 <a href="/index/Mag#change">Index entries for sequences related to making change.</a> %H A358012 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,1,-1). %F A358012 Sum of quotient and remainder of n/5. %F A358012 a(n) = A002266(n) + A010874(n). %t A358012 Array[Total@ QuotientRemainder[#, 5] &, 77, 0] (* _Michael De Vlieger_, Nov 03 2022 *) %o A358012 (PARI) a(n) = n\5 + n%5 \\ _Thomas Scheuerle_, Oct 24 2022 %o A358012 (PARI) a(n) = vecsum(divrem(n, 5)); \\ _Michel Marcus_, Nov 03 2022 %o A358012 (Python) def a(n): return n//5 + n%5 # _Michael S. Branicky_, Nov 03 2022 %Y A358012 Cf. A002266, A010874. %Y A358012 Cf. A076314 (1,10 cents), A053344 (1,5,10,25 cents). %K A358012 nonn,easy %O A358012 0,3 %A A358012 _Sandra Snan_, Oct 24 2022