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.

A079980 Number of permutations of length 2n satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..2n, with k=3, r=3, I={-2,0,1,2}. There is no one such permutation of length 2n+1.

Table of values

n a(n)
0 1
1 0
2 1
3 2
4 3
5 8
6 12
7 27
8 52
9 95
10 196
11 369
12 720
13 1408
14 2709
15 5292
16 10249
17 19894
18 38675
19 74992
20 145692
21 282823
22 549000
23 1066095
24 2069496
25 4018065
26 7801024
27 15144960
28 29404281
29 57086680
30 110832225
31 215178138
32 417759539
33 811069560
34 1574664364

List of values

[1, 0, 1, 2, 3, 8, 12, 27, 52, 95, 196, 369, 720, 1408, 2709, 5292, 10249, 19894, 38675, 74992, 145692, 282823, 549000, 1066095, 2069496, 4018065, 7801024, 15144960, 29404281, 57086680, 110832225, 215178138, 417759539, 811069560, 1574664364]