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.

A342659 The least prime that does not divide the n-th multiply perfect number: a(n) = A053669(A007691(n)).

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Mar 19 2021

Keywords

Crossrefs

Programs

  • Mathematica
    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: *)
    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 *)

Formula

a(n) = A053669(A007691(n)).