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.

A359382 a(n) = number of k < t such that rad(k) = rad(t) and k does not divide t, where t = A360768(n) and rad(k) = A007947(k).

Table of values

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

List of values

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