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.

A342660 The largest prime that divides the n-th multiply perfect number: a(n) = A006530(A007691(n)); a(1) = 1.

Table of values

n a(n)
1 1
2 3
3 7
4 5
5 31
6 7
7 127
8 7
9 13
10 31
11 19
12 31
13 8191
14 31
15 31
16 73
17 73
18 127
19 131071
20 19
21 19
22 89
23 151
24 127
25 524287
26 151
27 127
28 31
29 127
30 89
31 89
32 127
33 61
34 17
35 3851
36 1093
37 151
38 257
39 911
40 331
41 2147483647
42 3851
43 911
44 127
45 257
46 1093
47 331
48 331
49 337
50 337
51 337
52 257
53 683
54 3851
55 8191
56 1093
57 257
58 911
59 3851
60 1093
61 178481
62 8191
63 337
64 8191

List of values

[1, 3, 7, 5, 31, 7, 127, 7, 13, 31, 19, 31, 8191, 31, 31, 73, 73, 127, 131071, 19, 19, 89, 151, 127, 524287, 151, 127, 31, 127, 89, 89, 127, 61, 17, 3851, 1093, 151, 257, 911, 331, 2147483647, 3851, 911, 127, 257, 1093, 331, 331, 337, 337, 337, 257, 683, 3851, 8191, 1093, 257, 911, 3851, 1093, 178481, 8191, 337, 8191]