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.

A060502 a(n) = number of occupied digit slopes in the factorial base representation of n (see comments for the definition); number of drops in the n-th permutation of list A060117.

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 2
21 2
22 1
23 1
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 3
45 3
46 2
47 2
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 3
69 3
70 2
71 2
72 1
73 2
74 1
75 2
76 2
77 2
78 2
79 3
80 2
81 3
82 3
83 3
84 1
85 2
86 1
87 2
88 2
89 2
90 2
91 2
92 2
93 2
94 2
95 2
96 1
97 1
98 2
99 2
100 1
101 1
102 2
103 2
104 3
105 3
106 2
107 2
108 2
109 2
110 2
111 2
112 2
113 2
114 1
115 1
116 2
117 2
118 1
119 1
120 1

List of values

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