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.

A084193 Array read by antidiagonals: T(k,n) = solution to postage stamp problem with n stamps and k denominations (n >= 1, k >= 1).

Table of values

n a(n)
0 1
1 2
2 2
3 3
4 4
5 3
6 4
7 7
8 8
9 4
10 5
11 10
12 15
13 12
14 5
15 6
16 14
17 26
18 24
19 16
20 6
21 7
22 18
23 35
24 44
25 36
26 20
27 7
28 8
29 23
30 52
31 71
32 70
33 52
34 26
35 8
36 9
37 28
38 69
39 114
40 126
41 108
42 70
43 32
44 9
45 10
46 34
47 89
48 165
49 216
50 211
51 162
52 93
53 40
54 10
55 11
56 40
57 112
58 234
59 345
60 388
61 336
62 228
63 121
64 46
65 11
66 12
67 47
68 146
69 326
70 512

List of values

[1, 2, 2, 3, 4, 3, 4, 7, 8, 4, 5, 10, 15, 12, 5, 6, 14, 26, 24, 16, 6, 7, 18, 35, 44, 36, 20, 7, 8, 23, 52, 71, 70, 52, 26, 8, 9, 28, 69, 114, 126, 108, 70, 32, 9, 10, 34, 89, 165, 216, 211, 162, 93, 40, 10, 11, 40, 112, 234, 345, 388, 336, 228, 121, 46, 11, 12, 47, 146, 326, 512]