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.

A334144 Consider the mapping k -> (k - (k/p)), where prime p | k. a(n) = maximum distinct terms at any position j among the various paths 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 2
13 2
14 2
15 3
16 1
17 1
18 2
19 2
20 2
21 3
22 2
23 2
24 2
25 2
26 2
27 2
28 3
29 3
30 3
31 3
32 1
33 4
34 2
35 4
36 3
37 3
38 3
39 3
40 2
41 2
42 4
43 4
44 3
45 4
46 3
47 3
48 2
49 4
50 2
51 3
52 3
53 3
54 3
55 3
56 3
57 3
58 3
59 3
60 4
61 4
62 4
63 4
64 1
65 5
66 5
67 5
68 2
69 5
70 5
71 5
72 3
73 3
74 3
75 4
76 3
77 6
78 4
79 4
80 2
81 3
82 2
83 2
84 4
85 3
86 4
87 4
88 3
89 3
90 5
91 5
92 3
93 5
94 3
95 5
96 2
97 2
98 4
99 6
100 3
101 3
102 3
103 3
104 3
105 6
106 3

List of values

[1, 1, 1, 1, 1, 2, 2, 1, 2, 2, 2, 2, 2, 2, 3, 1, 1, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 1, 4, 2, 4, 3, 3, 3, 3, 2, 2, 4, 4, 3, 4, 3, 3, 2, 4, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 1, 5, 5, 5, 2, 5, 5, 5, 3, 3, 3, 4, 3, 6, 4, 4, 2, 3, 2, 2, 4, 3, 4, 4, 3, 3, 5, 5, 3, 5, 3, 5, 2, 2, 4, 6, 3, 3, 3, 3, 3, 6, 3]