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.

Original entry on oeis.org

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
Offset: 1

Views

Author

Antti Karttunen, Mar 19 2021

Keywords

Crossrefs

Cf. A000668, A072002 (subsequences), A006530, A007691.
Cf. also A134740, A342658, A342659.

Programs

Formula

a(n) = A006530(A007691(n)).