cp's OEIS Frontend

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.

A011542 Minimal number of coins needed to pay n cents using coins of sizes 1, 5, 10, 25, 50 cents.

Table of values

n a(n)
0 0
1 1
2 2
3 3
4 4
5 1
6 2
7 3
8 4
9 5
10 1
11 2
12 3
13 4
14 5
15 2
16 3
17 4
18 5
19 6
20 2
21 3
22 4
23 5
24 6
25 1
26 2
27 3
28 4
29 5
30 2
31 3
32 4
33 5
34 6
35 2
36 3
37 4
38 5
39 6
40 3
41 4
42 5
43 6
44 7
45 3
46 4
47 5
48 6
49 7
50 1
51 2
52 3
53 4
54 5
55 2
56 3
57 4
58 5
59 6
60 2
61 3
62 4
63 5
64 6
65 3
66 4
67 5
68 6
69 7
70 3
71 4
72 5
73 6
74 7
75 2
76 3
77 4
78 5
79 6
80 3
81 4
82 5
83 6
84 7
85 3
86 4
87 5
88 6
89 7
90 4
91 5
92 6
93 7
94 8
95 4
96 5
97 6
98 7
99 8
100 2
101 3

List of values

[0, 1, 2, 3, 4, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 2, 3, 4, 5, 6, 2, 3, 4, 5, 6, 1, 2, 3, 4, 5, 2, 3, 4, 5, 6, 2, 3, 4, 5, 6, 3, 4, 5, 6, 7, 3, 4, 5, 6, 7, 1, 2, 3, 4, 5, 2, 3, 4, 5, 6, 2, 3, 4, 5, 6, 3, 4, 5, 6, 7, 3, 4, 5, 6, 7, 2, 3, 4, 5, 6, 3, 4, 5, 6, 7, 3, 4, 5, 6, 7, 4, 5, 6, 7, 8, 4, 5, 6, 7, 8, 2, 3]