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.

A275851 a(n) = number of elements in range [1..(1+A084558(n))] fixed by the permutation with rank n of permutation list A060117 (or A060118).

Table of values

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

List of values

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