login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A342660 The largest prime that divides the n-th multiply perfect number: a(n) = A006530(A007691(n)); a(1) = 1. 4
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = A006530(A007691(n)).
MATHEMATICA
Map[FactorInteger[#][[-1, 1]] &, Select[Range[10^6], IntegerQ@ DivisorSigma[-1, #] &] ] (* or, using the b-file at A007691: *)
Map[FactorInteger[#][[-1, 1]] &, DeleteCases[Import["https://oeis.org/A007691/b007691.txt", "Data"], _?(Length@ # == 0 &)][[1 ;; 64, -1]] ] (* Michael De Vlieger, Mar 19 2021 *)
CROSSREFS
Cf. A000668, A072002 (subsequences), A006530, A007691.
Cf. also A134740, A342658, A342659.
Sequence in context: A097406 A064078 A292015 * A186522 A048857 A005420
KEYWORD
nonn
AUTHOR
Antti Karttunen, Mar 19 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)