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.

A384039 The number of integers k from 1 to n such that gcd(n,k) is a powerful number.

Table of values

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

List of values

[1, 1, 2, 3, 4, 2, 6, 6, 7, 4, 10, 6, 12, 6, 8, 12, 16, 7, 18, 12, 12, 10, 22, 12, 21, 12, 21, 18, 28, 8, 30, 24, 20, 16, 24, 21, 36, 18, 24, 24, 40, 12, 42, 30, 28, 22, 46, 24, 43, 21, 32, 36, 52, 21, 40, 36, 36, 28, 58, 24, 60, 30, 42, 48, 48, 20, 66, 48, 44]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.