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.

A337538 a(n) is the least k such that A003961(k*A071395(n)) is abundant.

Table of values

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

List of values

[6, 6, 15, 15, 15, 15, 15, 15, 3, 6, 6, 6, 9, 2, 15, 15, 15, 3, 15, 2, 15, 3, 15, 15, 6, 3, 2, 3, 3, 3, 9, 3, 9, 3, 3, 3, 2, 15, 6, 15, 6, 3, 2, 15, 15, 15, 3, 15, 15, 15, 3, 15, 15, 3, 15, 15, 2, 15, 15, 15, 15, 2, 3, 15, 2, 15, 15, 15, 2, 15, 15, 15, 15, 2, 15, 15, 15, 15, 15, 15, 2, 2, 15, 15, 15, 15, 2]