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.

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

Table of values

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

List of values

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