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.

A084192 Array read by antidiagonals: T(n,k) = 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 8
8 7
9 4
10 5
11 12
12 15
13 10
14 5
15 6
16 16
17 24
18 26
19 14
20 6
21 7
22 20
23 36
24 44
25 35
26 18
27 7
28 8
29 26
30 52
31 70
32 71
33 52
34 23
35 8
36 9
37 32
38 70
39 108
40 126
41 114
42 69
43 28
44 9
45 10
46 40
47 93
48 162
49 211
50 216
51 165
52 89
53 34
54 10
55 11
56 46
57 121
58 228
59 336
60 388
61 345
62 234
63 112
64 40
65 11
66 12
67 54
68 154
69 310
70 524

List of values

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