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.

A276837 Number A(n,k) of permutations of [n] such that for each cycle c the smallest integer interval containing all elements of c 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 6
25 5
26 1
27 0
28 1
29 1
30 2
31 6
32 12
33 8
34 1
35 0
36 1
37 1
38 2
39 6
40 24
41 25
42 13
43 1
44 0
45 1
46 1
47 2
48 6
49 24
50 60
51 57
52 21
53 1
54 0
55 1
56 1
57 2
58 6
59 24
60 120
61 150
62 124
63 34
64 1
65 0
66 1
67 1
68 2
69 6
70 24
71 120
72 360
73 399
74 268
75 55
76 1
77 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, 6, 5, 1, 0, 1, 1, 2, 6, 12, 8, 1, 0, 1, 1, 2, 6, 24, 25, 13, 1, 0, 1, 1, 2, 6, 24, 60, 57, 21, 1, 0, 1, 1, 2, 6, 24, 120, 150, 124, 34, 1, 0, 1, 1, 2, 6, 24, 120, 360, 399, 268, 55, 1, 0]