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.

A275007 Numbers n such that 2^n == sigma(n) (mod n).

This page as a plain text file.
%I A275007 #36 Dec 11 2016 23:43:05
%S A275007 1,12,286,5978,111136,283584,339379,1102652,8830498,27952828,30442612,
%T A275007 84638560,90619592,101907952,175917947
%N A275007 Numbers n such that 2^n == sigma(n) (mod n).
%C A275007 Numbers n such that A015910(n) = A054024(n). - _Michel Marcus_, Dec 11 2016
%e A275007 12 is a term because 2^12 == sigma(12) (mod 12).
%o A275007 (PARI) is(n)=Mod(2, n)^n==sigma(n);
%Y A275007 Cf. A000079, A000203, A015910, A054024.
%K A275007 nonn,more
%O A275007 1,2
%A A275007 _Altug Alkan_, Dec 11 2016