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.

A118806 Triangle read by rows: T(n,k) is the number of partitions of n having k parts of multiplicity 3 (n,k>=0).

Table of values

n a(n)
0 1
1 1
2 2
3 2
4 1
5 5
6 6
7 1
8 9
9 2
10 12
11 3
12 19
13 3
14 24
15 5
16 1
17 34
18 8
19 43
20 13
21 62
22 13
23 2
24 77
25 23
26 1
27 105
28 28
29 2
30 132
31 40
32 4
33 177
34 49
35 5
36 220
37 71
38 6
39 287
40 89
41 8
42 1
43 356
44 123
45 11
46 462
47 147
48 18
49 570
50 198
51 23
52 1
53 723
54 249
55 29
56 1
57 888
58 329
59 37
60 1
61 1121
62 400
63 50
64 4
65 1370
66 518
67 69
68 1
69 1705
70 642
71 85

List of values

[1, 1, 2, 2, 1, 5, 6, 1, 9, 2, 12, 3, 19, 3, 24, 5, 1, 34, 8, 43, 13, 62, 13, 2, 77, 23, 1, 105, 28, 2, 132, 40, 4, 177, 49, 5, 220, 71, 6, 287, 89, 8, 1, 356, 123, 11, 462, 147, 18, 570, 198, 23, 1, 723, 249, 29, 1, 888, 329, 37, 1, 1121, 400, 50, 4, 1370, 518, 69, 1, 1705, 642, 85]