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.

A245588 The minimal number of coins needed to make change for n units in a currency system with coins of value 1,2,5,13,34,89,...,Fibonacci(2k-1).

Table of values

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

List of values

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