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.

A369376 a(n) is the number of elements p(j) > j (right displacements) in the n-th permutation in lexicographic order.

Table of values

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

List of values

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