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.

A338508 Irregular table T(n, k) read by rows, n > 0 and k = 1..A000005(n); T(n, k) is the number of nonempty subsets of divisors of n with greatest common divisor of elements equal to the k-th divisor of n.

Table of values

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

List of values

[1, 2, 1, 2, 1, 4, 2, 1, 2, 1, 10, 2, 2, 1, 2, 1, 8, 4, 2, 1, 4, 2, 1, 10, 2, 2, 1, 2, 1, 44, 10, 4, 2, 2, 1, 2, 1, 10, 2, 2, 1, 10, 2, 2, 1, 16, 8, 4, 2, 1, 2, 1, 44, 4, 10, 2, 2, 1, 2, 1, 44, 10, 2, 4, 2, 1, 10, 2, 2, 1, 10, 2, 2, 1, 2, 1, 184, 44, 8, 10, 4, 2, 2, 1]