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.

A339334 Triangle read by rows, 1 <= k <= n: T(n,k) is the sum of the minimal number of coins needed for amounts 1..n with an optimal greedy k-coin system of denominations.

Table of values

n a(n)
1 1
2 3
3 2
4 6
5 4
6 3
7 10
8 6
9 5
10 4
11 15
12 9
13 7
14 6
15 5
16 21
17 11
18 9
19 8
20 7
21 6
22 28
23 14
24 11
25 10
26 9
27 8
28 7
29 36
30 18
31 14
32 12
33 11
34 10
35 9
36 8
37 45
38 21
39 17
40 14
41 13
42 12
43 11
44 10
45 9
46 55
47 25
48 19
49 16
50 15
51 14
52 13
53 12
54 11
55 10
56 66
57 30
58 22
59 19
60 17
61 16
62 15
63 14
64 13
65 12
66 11

List of values

[1, 3, 2, 6, 4, 3, 10, 6, 5, 4, 15, 9, 7, 6, 5, 21, 11, 9, 8, 7, 6, 28, 14, 11, 10, 9, 8, 7, 36, 18, 14, 12, 11, 10, 9, 8, 45, 21, 17, 14, 13, 12, 11, 10, 9, 55, 25, 19, 16, 15, 14, 13, 12, 11, 10, 66, 30, 22, 19, 17, 16, 15, 14, 13, 12, 11]