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.

A180188 Triangle read by rows: T(n,k) is the number of permutations of [n] with k circular successions (0<=k<=n-1). A circular succession in a permutation p of [n] is either a pair p(i), p(i+1), where p(i+1)=p(i)+1 or the pair p(n), p(1) if p(1)=p(n)+1.

Table of values

n a(n)
1 1
2 0
3 2
4 3
5 0
6 3
7 8
8 12
9 0
10 4
11 45
12 40
13 30
14 0
15 5
16 264
17 270
18 120
19 60
20 0
21 6
22 1855
23 1848
24 945
25 280
26 105
27 0
28 7
29 14832
30 14840
31 7392
32 2520
33 560
34 168
35 0
36 8
37 133497
38 133488
39 66780
40 22176
41 5670
42 1008
43 252
44 0
45 9
46 1334960
47 1334970
48 667440
49 222600
50 55440
51 11340
52 1680
53 360
54 0

List of values

[1, 0, 2, 3, 0, 3, 8, 12, 0, 4, 45, 40, 30, 0, 5, 264, 270, 120, 60, 0, 6, 1855, 1848, 945, 280, 105, 0, 7, 14832, 14840, 7392, 2520, 560, 168, 0, 8, 133497, 133488, 66780, 22176, 5670, 1008, 252, 0, 9, 1334960, 1334970, 667440, 222600, 55440, 11340, 1680, 360, 0]