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.

A046663 Triangle: T(n,k) = number of partitions of n (>=2) with no subsum equal to k (1 <= k <= n-1).

Table of values

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

List of values

[1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 4, 3, 5, 3, 4, 4, 4, 4, 4, 4, 4, 7, 5, 7, 8, 7, 5, 7, 8, 7, 7, 8, 8, 7, 7, 8, 12, 9, 12, 9, 17, 9, 12, 9, 12, 14, 11, 12, 12, 13, 13, 12, 12, 11, 14, 21, 15, 19, 15, 21, 24, 21, 15, 19, 15, 21, 24, 19, 20, 19, 21, 22, 22, 21, 19, 20, 19, 24, 34, 23, 30, 24, 30, 25, 46, 25, 30, 24, 30, 23, 34]