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.

A067995 Minimal number of coins needed to pay exactly n cents using coins of sizes 1, 2, 3, 5, 10, 20, 25, 50, 100 cents (all historical U.S.A. coinage from 1 to 100 cents).

Table of values

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

List of values

[1, 1, 1, 2, 1, 2, 2, 2, 3, 1, 2, 2, 2, 3, 2, 3, 3, 3, 4, 1, 2, 2, 2, 3, 1, 2, 2, 2, 3, 2, 3, 3, 3, 4, 2, 3, 3, 3, 4, 2, 3, 3, 3, 4, 2, 3, 3, 3, 4, 1, 2, 2, 2, 3, 2, 3, 3, 3, 4, 2, 3, 3, 3, 4, 3, 4, 4, 4, 5, 2, 3, 3, 3, 4, 2, 3, 3, 3, 4, 3, 4, 4, 4, 5, 3, 4, 4, 4, 5, 3, 4, 4, 4, 5, 3, 4, 4, 4, 5, 1, 2, 2, 2, 3, 2]