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.

A180253 Call two divisors of n adjacent if the larger is a prime times the smaller. a(n) is the sum of elements of all pairs of adjacent divisors of n.

Table of values

n a(n)
1 0
2 3
3 4
4 9
5 6
6 24
7 8
8 21
9 16
10 36
11 12
12 64
13 14
14 48
15 48
16 45
17 18
18 87
19 20
20 96
21 64
22 72
23 24
24 144
25 36
26 84
27 52
28 128
29 30
30 216
31 32
32 93
33 96
34 108
35 96
36 229
37 38
38 120
39 112
40 216
41 42
42 288
43 44
44 192
45 174
46 144
47 48
48 304
49 64
50 201
51 144
52 224
53 54
54 276
55 144
56 288
57 160
58 180
59 60
60 552
61 62
62 192
63 232
64 189

List of values

[0, 3, 4, 9, 6, 24, 8, 21, 16, 36, 12, 64, 14, 48, 48, 45, 18, 87, 20, 96, 64, 72, 24, 144, 36, 84, 52, 128, 30, 216, 32, 93, 96, 108, 96, 229, 38, 120, 112, 216, 42, 288, 44, 192, 174, 144, 48, 304, 64, 201, 144, 224, 54, 276, 144, 288, 160, 180, 60, 552, 62, 192, 232, 189]