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.

A358266 Numbers k such that the aliquot sequence of 2^k ends with the prime 7.

This page as a plain text file.
%I A358266 #9 Nov 06 2022 07:33:37
%S A358266 3,10,12,141,278,387,421
%N A358266 Numbers k such that the aliquot sequence of 2^k ends with the prime 7.
%H A358266 Jean-Luc Garambois, <a href="http://www.aliquotes.com/aliquotes_puissances_entieres/aliquotes_puissances_entieres.html">Aliquot sequences starting on integer powers n^i</a>, n^i project.
%H A358266 Mersenne forum, <a href="https://mersenneforum.org/showpost.php?p=617134&amp;postcount=2053">n^i project</a>.
%F A358266 Define s(i) = sigma(i) - i = A000203(i) - i. Then k is a term of this sequence if the aliquot sequence obtained by repeatedly applying the mapping i->s(i) taking as initial value 2^k terminates in the prime 7.
%e A358266 a(4)=141 because the aliquot sequence that starts with the integer 2^141 ends with the prime number 7 and there are only three smaller powers of 2 that do the same: 2^3, 2^10 and 2^12.
%o A358266 (PARI) f(n) = if (n==1, return(2)); my(list = List(), s=2^n); for (i=1, oo, s = sigma(s) - s; if (#select(x->(x==s), list), return(0)); if (isprime(s), return (s)); listput(list, s); );
%o A358266 isok(m) = f(m) == 7;
%Y A358266 Cf. A127164, A358239.
%K A358266 nonn,hard,more
%O A358266 1,1
%A A358266 _Jean Luc Garambois_, Nov 06 2022