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.

A246118 T(n,k), for n,k >= 1, is the number of partitions of the set [n] into k blocks, where, if the blocks are arranged in order of their minimal element, the odd-indexed blocks are all singletons.

Table of values

n a(n)
1 1
2 0
3 1
4 0
5 1
6 1
7 0
8 1
9 2
10 1
11 0
12 1
13 3
14 4
15 1
16 0
17 1
18 4
19 11
20 6
21 1
22 0
23 1
24 5
25 26
26 23
27 9
28 1
29 0
30 1
31 6
32 57
33 72
34 50
35 12
36 1
37 0
38 1
39 7
40 120
41 201
42 222
43 86
44 16
45 1
46 0
47 1
48 8
49 247
50 522
51 867
52 480
53 150
54 20
55 1
56 0
57 1
58 9
59 502
60 1291
61 3123
62 2307
63 1080
64 230
65 25
66 1
67 0
68 1
69 10
70 1013
71 3084
72 10660
73 10044
74 6627
75 2000
76 355
77 30
78 1

List of values

[1, 0, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 3, 4, 1, 0, 1, 4, 11, 6, 1, 0, 1, 5, 26, 23, 9, 1, 0, 1, 6, 57, 72, 50, 12, 1, 0, 1, 7, 120, 201, 222, 86, 16, 1, 0, 1, 8, 247, 522, 867, 480, 150, 20, 1, 0, 1, 9, 502, 1291, 3123, 2307, 1080, 230, 25, 1, 0, 1, 10, 1013, 3084, 10660, 10044, 6627, 2000, 355, 30, 1]