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.

A111246 Triangle read by rows: a(n,k) = number of partitions of an n-set into exactly k nonempty subsets, each of size <= 3.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 3
6 1
7 0
8 7
9 6
10 1
11 0
12 10
13 25
14 10
15 1
16 0
17 10
18 75
19 65
20 15
21 1
22 0
23 0
24 175
25 315
26 140
27 21
28 1
29 0
30 0
31 280
32 1225
33 980
34 266
35 28
36 1
37 0
38 0
39 280
40 3780
41 5565
42 2520
43 462
44 36
45 1
46 0
47 0
48 0
49 9100
50 26145
51 19425
52 5670
53 750
54 45
55 1
56 0
57 0
58 0
59 15400
60 102025
61 125895
62 56595
63 11550
64 1155

List of values

[1, 1, 1, 1, 3, 1, 0, 7, 6, 1, 0, 10, 25, 10, 1, 0, 10, 75, 65, 15, 1, 0, 0, 175, 315, 140, 21, 1, 0, 0, 280, 1225, 980, 266, 28, 1, 0, 0, 280, 3780, 5565, 2520, 462, 36, 1, 0, 0, 0, 9100, 26145, 19425, 5670, 750, 45, 1, 0, 0, 0, 15400, 102025, 125895, 56595, 11550, 1155]