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.

A265390 a(n) = lcm_{d|n} tau(d) * Sum_{d|n} 1/tau(d), where tau(d) represents the number of divisors of d (A000005(d)).

Table of values

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

List of values

[1, 3, 3, 11, 3, 9, 3, 25, 11, 9, 3, 33, 3, 9, 9, 137, 3, 33, 3, 33, 9, 9, 3, 75, 11, 9, 25, 33, 3, 27, 3, 147, 9, 9, 9, 121, 3, 9, 9, 75, 3, 27, 3, 33, 33, 9, 3, 411, 11, 33, 9, 33, 3, 75, 9, 75, 9, 9, 3, 99, 3, 9, 33, 1089, 9, 27, 3, 33, 9, 27, 3, 275, 3, 9, 33, 33, 9, 27, 3, 411, 137, 9, 3, 99, 9, 9, 9, 75, 3, 99, 9, 33]