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.

A369377 a(n) is the number of elements p(j) < j (left displacements) in the n-th permutation in lexicographic order.

Table of values

n a(n)
0 0
1 1
2 1
3 1
4 2
5 1
6 1
7 2
8 1
9 1
10 2
11 1
12 2
13 2
14 1
15 1
16 2
17 2
18 3
19 2
20 2
21 1
22 2
23 2
24 1
25 2
26 2
27 2
28 3
29 2
30 1
31 2
32 1
33 1
34 2
35 1
36 2
37 2
38 1
39 1
40 2
41 2
42 3
43 2
44 2
45 1
46 2
47 2
48 2
49 3
50 2
51 2
52 3
53 2
54 1
55 2
56 1
57 1
58 2
59 1
60 2
61 2
62 2
63 2
64 2
65 2
66 3
67 2
68 3
69 2
70 2
71 2
72 3
73 3
74 2
75 2
76 3
77 3
78 2
79 2
80 1
81 1
82 2
83 2
84 2
85 2
86 2
87 2
88 2
89 2
90 3
91 3
92 3
93 3
94 2
95 2
96 4
97 3
98 3
99 2
100 3
101 3
102 3
103 2
104 2
105 1
106 2
107 2
108 3
109 2
110 3
111 2
112 2
113 2
114 3
115 3
116 3
117 3
118 2
119 2

List of values

[0, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 2, 2, 1, 1, 2, 2, 3, 2, 2, 1, 2, 2, 1, 2, 2, 2, 3, 2, 1, 2, 1, 1, 2, 1, 2, 2, 1, 1, 2, 2, 3, 2, 2, 1, 2, 2, 2, 3, 2, 2, 3, 2, 1, 2, 1, 1, 2, 1, 2, 2, 2, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 3, 2, 2, 3, 3, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 2, 2, 4, 3, 3, 2, 3, 3, 3, 2, 2, 1, 2, 2, 3, 2, 3, 2, 2, 2, 3, 3, 3, 3, 2, 2]