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.

A237194 Triangular array: T(n,k) = number of strict partitions P of n into positive parts such that P includes a partition of k.

Table of values

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

List of values

[1, 0, 1, 1, 1, 2, 1, 0, 1, 2, 1, 1, 1, 1, 3, 2, 2, 1, 2, 2, 4, 2, 2, 2, 2, 2, 2, 5, 3, 2, 3, 1, 3, 2, 3, 6, 3, 3, 4, 3, 3, 4, 3, 3, 8, 5, 4, 5, 4, 3, 4, 5, 4, 5, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 12, 7, 6, 7, 7, 7, 4, 7, 7, 7, 6, 7, 15, 8, 7, 8, 8, 8, 8, 8]