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.

A124420 Triangle read by rows: T(n,k) is the number of partitions of the set {1,2,...,n}, having exactly k blocks consisting only odd entries (0<=k<=ceiling(n/2)).

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 1
5 1
6 3
7 1
8 5
9 8
10 2
11 9
12 26
13 15
14 2
15 52
16 101
17 45
18 5
19 130
20 385
21 287
22 70
23 5
24 855
25 1889
26 1143
27 238
28 15
29 2707
30 8295
31 7320
32 2475
33 335
34 15
35 19921
36 48382
37 35805
38 10540
39 1275
40 52
41 75771
42 240534
43 240082
44 100940
45 19505
46 1686
47 52
48 614866
49 1609551
50 1379753
51 512710

List of values

[1, 0, 1, 1, 1, 1, 3, 1, 5, 8, 2, 9, 26, 15, 2, 52, 101, 45, 5, 130, 385, 287, 70, 5, 855, 1889, 1143, 238, 15, 2707, 8295, 7320, 2475, 335, 15, 19921, 48382, 35805, 10540, 1275, 52, 75771, 240534, 240082, 100940, 19505, 1686, 52, 614866, 1609551, 1379753, 512710]