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.

A276719 Number A(n,k) of set partitions of [n] such that for each block b the smallest integer interval containing b has at most k elements; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

n a(n)
0 1
1 1
2 0
3 1
4 1
5 0
6 1
7 1
8 1
9 0
10 1
11 1
12 2
13 1
14 0
15 1
16 1
17 2
18 3
19 1
20 0
21 1
22 1
23 2
24 5
25 5
26 1
27 0
28 1
29 1
30 2
31 5
32 10
33 8
34 1
35 0
36 1
37 1
38 2
39 5
40 15
41 20
42 13
43 1
44 0
45 1
46 1
47 2
48 5
49 15
50 37
51 42
52 21
53 1
54 0
55 1
56 1
57 2
58 5
59 15
60 52
61 87
62 87
63 34
64 1
65 0
66 1
67 1
68 2
69 5
70 15
71 52
72 151
73 208
74 179
75 55
76 1
77 0
78 1
79 1
80 2
81 5
82 15
83 52
84 203
85 409
86 515
87 370
88 89
89 1
90 0

List of values

[1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 2, 1, 0, 1, 1, 2, 3, 1, 0, 1, 1, 2, 5, 5, 1, 0, 1, 1, 2, 5, 10, 8, 1, 0, 1, 1, 2, 5, 15, 20, 13, 1, 0, 1, 1, 2, 5, 15, 37, 42, 21, 1, 0, 1, 1, 2, 5, 15, 52, 87, 87, 34, 1, 0, 1, 1, 2, 5, 15, 52, 151, 208, 179, 55, 1, 0, 1, 1, 2, 5, 15, 52, 203, 409, 515, 370, 89, 1, 0]