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.

A261275 Number of set partitions C_t(n) of {1,2,...,t} into at most n parts, with an even number of elements in each part distinguished by marks; triangle C_t(n), t>=0, 0<=n<=t, read by rows.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 2
5 3
6 0
7 4
8 10
9 11
10 0
11 8
12 36
13 48
14 49
15 0
16 16
17 136
18 236
19 256
20 257
21 0
22 32
23 528
24 1248
25 1508
26 1538
27 1539
28 0
29 64
30 2080
31 6896
32 9696
33 10256
34 10298
35 10299
36 0
37 128
38 8256
39 39168
40 66384
41 74784
42 75848
43 75904
44 75905
45 0
46 256
47 32896
48 226496
49 475136
50 586352
51 607520
52 609368
53 609440
54 609441

List of values

[1, 0, 1, 0, 2, 3, 0, 4, 10, 11, 0, 8, 36, 48, 49, 0, 16, 136, 236, 256, 257, 0, 32, 528, 1248, 1508, 1538, 1539, 0, 64, 2080, 6896, 9696, 10256, 10298, 10299, 0, 128, 8256, 39168, 66384, 74784, 75848, 75904, 75905, 0, 256, 32896, 226496, 475136, 586352, 607520, 609368, 609440, 609441]