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.

A332810 Number of integers in range 1..n that are not encountered on any of the possible paths from n to 1 when iterating with nondeterministic map k -> k - k/p, where p is any prime factor of k.

Table of values

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

List of values

[0, 0, 0, 1, 1, 1, 1, 4, 3, 4, 4, 5, 5, 5, 5, 11, 11, 9, 9, 12, 9, 12, 12, 15, 16, 15, 17, 16, 16, 16, 16, 26, 16, 26, 17, 24, 24, 24, 24, 30, 30, 25, 25, 31, 27, 31, 31, 37, 31, 38, 37, 38, 38, 40, 39, 41, 40, 41, 41, 42, 42, 42, 43, 57, 43, 43, 43, 58, 43, 46, 46, 57, 57, 57, 54, 58, 47, 58, 58, 68, 66, 68, 68, 62, 69, 62, 62, 72, 72]