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.

A385133 The number of integers k from 1 to n such that gcd(n, k) has an odd maximum exponent in its prime factorization.

Table of values

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

List of values

[0, 1, 1, 1, 1, 4, 1, 3, 2, 6, 1, 5, 1, 8, 7, 5, 1, 10, 1, 7, 9, 12, 1, 13, 4, 14, 7, 9, 1, 22, 1, 11, 13, 18, 11, 12, 1, 20, 15, 19, 1, 30, 1, 13, 16, 24, 1, 23, 6, 28, 19, 15, 1, 32, 15, 25, 21, 30, 1, 29, 1, 32, 20, 21, 17, 46, 1, 19, 25, 46, 1, 33, 1, 38, 32]