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.

A080002 Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=3, I={-1,0,1}.

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 1
5 1
6 0
7 0
8 1
9 3
10 1
11 1
12 1
13 6
14 6
15 4
16 5
17 10
18 20
19 16
20 20
21 25
22 50
23 60
24 66
25 85
26 125
27 190
28 216
29 281
30 365
31 545
32 701
33 883
34 1156
35 1576
36 2176
37 2761
38 3636
39 4784
40 6560
41 8620
42 11265
43 14856
44 19840
45 26600
46 34825
47 46045
48 60856
49 81420
50 107625
51 142055
52 187881
53 249461

List of values

[1, 0, 0, 0, 1, 1, 0, 0, 1, 3, 1, 1, 1, 6, 6, 4, 5, 10, 20, 16, 20, 25, 50, 60, 66, 85, 125, 190, 216, 281, 365, 545, 701, 883, 1156, 1576, 2176, 2761, 3636, 4784, 6560, 8620, 11265, 14856, 19840, 26600, 34825, 46045, 60856, 81420, 107625, 142055, 187881, 249461]