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.

A383352 Triangle read by rows: T(n, k) is the number of partitions of a 2-colored set of n objects into at most k parts where 0 <= k <= n, and each part is one of 2 kinds.

Table of values

n a(n)
0 1
1 0
2 4
3 0
4 6
5 16
6 0
7 8
8 32
9 52
10 0
11 10
12 63
13 123
14 158
15 0
16 12
17 100
18 264
19 384
20 440
21 0
22 14
23 158
24 506
25 876
26 1086
27 1170
28 0
29 16
30 224
31 896
32 1800
33 2500
34 2836
35 2956
36 0
37 18
38 317
39 1491
40 3489
41 5359
42 6542
43 7046
44 7211
45 0
46 20
47 420
48 2372
49 6324
50 10848
51 14208
52 16056
53 16776
54 16996

List of values

[1, 0, 4, 0, 6, 16, 0, 8, 32, 52, 0, 10, 63, 123, 158, 0, 12, 100, 264, 384, 440, 0, 14, 158, 506, 876, 1086, 1170, 0, 16, 224, 896, 1800, 2500, 2836, 2956, 0, 18, 317, 1491, 3489, 5359, 6542, 7046, 7211, 0, 20, 420, 2372, 6324, 10848, 14208, 16056, 16776, 16996]