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.
%I A342659 #16 Mar 21 2021 01:38:10
%S A342659 2,5,3,7,3,5,3,11,11,5,11,7,3,7,5,3,11,5,3,13,11,7,3,7,3,11,5,11,5,13,
%T A342659 11,5,11,11,7,7,5,13,5,5,3,11,5,11,23,11,11,11,11,11,11,23,11,13,7,13,
%U A342659 23,11,5,5,13,5,11,5,17,17,17,17,17,17,17,17,13,17,17,11,19,11,23,19,11,5,7,11,5,7,17,17,7,7,5
%N A342659 The least prime that does not divide the n-th multiply perfect number: a(n) = A053669(A007691(n)).
%H A342659 Amiram Eldar, <a href="/A342659/b342659.txt">Table of n, a(n) for n = 1..1600</a>
%F A342659 a(n) = A053669(A007691(n)).
%t A342659 Map[Block[{k = 1}, While[Mod[#, Prime[k]] == 0, k++]; Prime[k]] &, Select[Range[10^6], IntegerQ@ DivisorSigma[-1, #] &] ] (* or, using the b-file at A007691: *)
%t A342659 Map[Block[{k = 1}, While[Mod[#, Prime[k]] == 0, k++]; Prime[k]] &, DeleteCases[Import["https://oeis.org/A007691/b007691.txt", "Data"], _?(Length@ # == 0 &)][[1 ;; 91, -1]] ] (* _Michael De Vlieger_, Mar 19 2021 *)
%Y A342659 Cf. A007691, A053669.
%Y A342659 Cf. also A134740, A342658, A342660.
%K A342659 nonn
%O A342659 1,1
%A A342659 _Antti Karttunen_, Mar 19 2021