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.

A293782 a(n) is the number of permutations of {1, 2, 3, 4} that avoid the list of pairs encrypted in n (see comments below).

Table of values

n a(n)
0 24
1 18
2 18
3 12
4 18
5 12
6 12
7 6
8 18
9 14
10 12
11 8
12 14
13 10
14 8
15 4
16 18
17 14
18 14
19 10
20 12
21 8
22 8
23 4
24 12
25 10
26 8
27 6
28 8
29 6
30 4
31 2
32 18
33 14
34 14
35 10
36 12
37 8
38 8
39 4
40 14
41 11
42 10
43 7
44 10
45 7
46 6
47 3
48 12
49 10
50 10
51 8
52 6
53 4
54 4
55 2
56 8
57 7
58 6
59 5
60 4
61 3
62 2
63 1
64 18
65 12
66 14
67 8
68 14
69 8
70 10
71 4
72 12
73 8
74 8
75 4

List of values

[24, 18, 18, 12, 18, 12, 12, 6, 18, 14, 12, 8, 14, 10, 8, 4, 18, 14, 14, 10, 12, 8, 8, 4, 12, 10, 8, 6, 8, 6, 4, 2, 18, 14, 14, 10, 12, 8, 8, 4, 14, 11, 10, 7, 10, 7, 6, 3, 12, 10, 10, 8, 6, 4, 4, 2, 8, 7, 6, 5, 4, 3, 2, 1, 18, 12, 14, 8, 14, 8, 10, 4, 12, 8, 8, 4]