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.

A124424 Triangle read by rows: T(n,k) is the number of partitions of the set {1,2,...,n}, having exactly k blocks consisting of entries of the same parity (0<=k<=n).

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 0
5 1
6 1
7 2
8 1
9 1
10 3
11 4
12 5
13 2
14 1
15 7
16 14
17 16
18 10
19 4
20 1
21 25
22 48
23 61
24 42
25 20
26 6
27 1
28 79
29 194
30 250
31 200
32 106
33 38
34 9
35 1
36 339
37 820
38 1145
39 958
40 569
41 230
42 66
43 12
44 1
45 1351
46 3794
47 5554
48 5096
49 3251
50 1486
51 486
52 112
53 16
54 1
55 6721
56 18960
57 29101
58 28010
59 19110
60 9470
61 3477
62 930
63 175
64 20
65 1

List of values

[1, 0, 1, 1, 0, 1, 1, 2, 1, 1, 3, 4, 5, 2, 1, 7, 14, 16, 10, 4, 1, 25, 48, 61, 42, 20, 6, 1, 79, 194, 250, 200, 106, 38, 9, 1, 339, 820, 1145, 958, 569, 230, 66, 12, 1, 1351, 3794, 5554, 5096, 3251, 1486, 486, 112, 16, 1, 6721, 18960, 29101, 28010, 19110, 9470, 3477, 930, 175, 20, 1]