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.

A060500 a(n) = number of drops in the n-th permutation of list A060118; the average of digits (where "digits" may eventually obtain also any values > 9) in each siteswap pattern A060496(n).

Table of values

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

List of values

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