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.

A117147 Triangle read by rows: T(n,k) is the number of partitions of n with k parts in which no part occurs more than 3 times (n>=1, k>=1).

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 3, 3, 2, 1, 3, 4, 3, 1, 1, 4, 5, 4, 2, 1, 4, 7, 6, 3, 1, 1, 5, 8, 9, 5, 1, 1, 5, 10, 11, 8, 3, 1, 6, 12, 14, 11, 5, 1, 1, 6, 14, 18, 15, 8, 2, 1, 7, 16, 23, 20, 11, 4, 1, 7, 19, 27, 27, 17, 6, 1, 1, 8, 21, 33, 34, 23, 10, 2, 1, 8, 24, 39, 43, 32, 15, 4, 1, 9]