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.

A376931 Number of points out of n points placed on a circle that can never be reached when starting at one point and then moving clockwise in incrementally increasing steps (first 1, then 2, 3, 4, ...).

Table of values

n a(n)
1 0
2 0
3 1
4 0
5 2
6 2
7 3
8 0
9 5
10 4
11 5
12 4
13 6
14 6
15 9
16 0
17 8
18 10
19 9
20 8
21 13
22 10
23 11
24 8
25 14
26 12
27 16
28 12
29 14
30 18
31 15
32 0
33 21
34 16
35 23
36 20
37 18
38 18
39 25
40 16
41 20
42 26
43 21
44 20
45 33
46 22
47 23
48 16
49 27
50 28
51 33
52 24
53 26
54 32
55 37
56 24
57 37
58 28
59 29
60 36
61 30
62 30
63 47
64 0
65 44
66 42
67 33
68 32
69 45
70 46
71 35

List of values

[0, 0, 1, 0, 2, 2, 3, 0, 5, 4, 5, 4, 6, 6, 9, 0, 8, 10, 9, 8, 13, 10, 11, 8, 14, 12, 16, 12, 14, 18, 15, 0, 21, 16, 23, 20, 18, 18, 25, 16, 20, 26, 21, 20, 33, 22, 23, 16, 27, 28, 33, 24, 26, 32, 37, 24, 37, 28, 29, 36, 30, 30, 47, 0, 44, 42, 33, 32, 45, 46, 35]