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.

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

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 2
6 1
7 4
8 6
9 4
10 1
11 10
12 18
13 17
14 6
15 1
16 25
17 61
18 68
19 38
20 10
21 1
22 75
23 210
24 292
25 202
26 83
27 14
28 1
29 225
30 778
31 1252
32 1116
33 576
34 170
35 22
36 1
37 780
38 3008
39 5670
40 5928
41 3899
42 1490
43 341
44 30
45 1
46 2704
47 12219
48 26114
49 32382
50 25320
51 12655
52 3856
53 678
54 46
55 1
56 10556
57 52268
58 126073
59 177666
60 163695
61 98282
62 39230
63 9418
64 1319
65 62
66 1

List of values

[1, 1, 1, 1, 2, 2, 1, 4, 6, 4, 1, 10, 18, 17, 6, 1, 25, 61, 68, 38, 10, 1, 75, 210, 292, 202, 83, 14, 1, 225, 778, 1252, 1116, 576, 170, 22, 1, 780, 3008, 5670, 5928, 3899, 1490, 341, 30, 1, 2704, 12219, 26114, 32382, 25320, 12655, 3856, 678, 46, 1, 10556, 52268, 126073, 177666, 163695, 98282, 39230, 9418, 1319, 62, 1]