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.

A333123 Consider the mapping k -> (k - (k/p)), where p is any of k's prime factors. a(n) is the number of different possible paths from n to 1.

Table of values

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

List of values

[1, 1, 1, 1, 1, 2, 2, 1, 2, 2, 2, 3, 3, 5, 5, 1, 1, 5, 5, 3, 10, 5, 5, 4, 3, 7, 5, 9, 9, 12, 12, 1, 17, 2, 21, 9, 9, 14, 16, 4, 4, 28, 28, 9, 21, 14, 14, 5, 28, 7, 7, 12, 12, 14, 16, 14, 28, 23, 23, 21, 21, 33, 42, 1, 33, 47, 47, 3, 61, 56, 56, 14, 14, 23, 28, 28, 103, 42, 42, 5]