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.

A363519 Number T(n,k) of partitions of [n] having exactly k parity changes within the partition, n>=0, 0<=k<=max(0,n-1), read by rows.

Table of values

n a(n)
0 1
1 1
2 0
3 2
4 0
5 1
6 4
7 0
8 3
9 4
10 8
11 0
12 2
13 18
14 14
15 18
16 0
17 7
18 27
19 87
20 42
21 40
22 0
23 5
24 102
25 162
26 360
27 147
28 101
29 0
30 20
31 179
32 866
33 931
34 1456
35 434
36 254
37 0
38 15
39 675
40 1746
41 5836
42 4755
43 5778
44 1619
45 723
46 0
47 67
48 1321
49 9087
50 16416
51 36031
52 22893
53 23052
54 5044
55 2064
56 0
57 52
58 5216
59 19863
60 93452
61 117172
62 206570
63 115178
64 94210
65 20271
66 6586

List of values

[1, 1, 0, 2, 0, 1, 4, 0, 3, 4, 8, 0, 2, 18, 14, 18, 0, 7, 27, 87, 42, 40, 0, 5, 102, 162, 360, 147, 101, 0, 20, 179, 866, 931, 1456, 434, 254, 0, 15, 675, 1746, 5836, 4755, 5778, 1619, 723, 0, 67, 1321, 9087, 16416, 36031, 22893, 23052, 5044, 2064, 0, 52, 5216, 19863, 93452, 117172, 206570, 115178, 94210, 20271, 6586]