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.

A340273 a(n) is the number of divisors d of n such that phi(n)/phi(lpf(n)) mod phi(n)/phi(d) = 0, where phi is Euler's totient function (A000010), and lpf(n) is the least prime factor of n (A020639).

Table of values

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

List of values

[1, 2, 1, 3, 1, 4, 1, 4, 2, 4, 1, 6, 1, 4, 3, 5, 1, 6, 1, 6, 3, 4, 1, 8, 2, 4, 3, 6, 1, 8, 1, 6, 3, 4, 2, 9, 1, 4, 3, 8, 1, 8, 1, 6, 5, 4, 1, 10, 2, 6, 3, 6, 1, 8, 2, 8, 3, 4, 1, 12, 1, 4, 5, 7, 3, 8, 1, 6, 3, 8, 1, 12, 1, 4, 5, 6, 2, 8, 1, 10, 4, 4, 1, 12, 3, 4]