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.

A336422 Number of ways to choose a divisor of a divisor of n, both having distinct prime exponents.

Table of values

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

List of values

[1, 3, 3, 6, 3, 5, 3, 10, 6, 5, 3, 13, 3, 5, 5, 15, 3, 13, 3, 13, 5, 5, 3, 24, 6, 5, 10, 13, 3, 7, 3, 21, 5, 5, 5, 21, 3, 5, 5, 24, 3, 7, 3, 13, 13, 5, 3, 38, 6, 13, 5, 13, 3, 24, 5, 24, 5, 5, 3, 20, 3, 5, 13, 28, 5, 7, 3, 13, 5, 7, 3, 42, 3, 5, 13, 13, 5, 7, 3]

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

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