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.

A260688 a(n) = the least number of pieces of currency of denominations .01, .05, .10, .25, 1, 5, 10, 20, 50, 100 that the greedy algorithm uses to make n times .01 (n "cents") in change.

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 2
51 3
52 4
53 5
54 6
55 3
56 4
57 5
58 6
59 7
60 3
61 4
62 5
63 6
64 7
65 4
66 5
67 6
68 7
69 8
70 4
71 5
72 6
73 7
74 8
75 3
76 4
77 5
78 6
79 7
80 4
81 5
82 6
83 7
84 8
85 4
86 5
87 6
88 7
89 8
90 5
91 6
92 7
93 8
94 9
95 5
96 6
97 7
98 8
99 9

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, 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, 3, 4, 5, 6, 7, 4, 5, 6, 7, 8, 4, 5, 6, 7, 8, 5, 6, 7, 8, 9, 5, 6, 7, 8, 9]