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.

A174469 Number of permutations p of {1,...,n} satisfying p(1)=1 and, if n>1, |p(i)-p((i mod n)+1)| is in {2,3} for i from 1 to n.

Table of values

n a(n)
1 1
2 0
3 0
4 0
5 2
6 0
7 0
8 0
9 0
10 2
11 2
12 2
13 2
14 2
15 4
16 6
17 8
18 10
19 12
20 16
21 22
22 30
23 40
24 52
25 68
26 90
27 120
28 160
29 212
30 280
31 370
32 490
33 650
34 862
35 1142
36 1512
37 2002
38 2652
39 3514
40 4656
41 6168
42 8170
43 10822
44 14336
45 18992
46 25160
47 33330
48 44152
49 58488
50 77480
51 102640
52 135970

List of values

[1, 0, 0, 0, 2, 0, 0, 0, 0, 2, 2, 2, 2, 2, 4, 6, 8, 10, 12, 16, 22, 30, 40, 52, 68, 90, 120, 160, 212, 280, 370, 490, 650, 862, 1142, 1512, 2002, 2652, 3514, 4656, 6168, 8170, 10822, 14336, 18992, 25160, 33330, 44152, 58488, 77480, 102640, 135970]