cp's OEIS Frontend

A336892 Numbers that are a divisor of the sum of their divisors to their own powers.

%I A336892 #33 Aug 14 2020 23:57:03
%S A336892 1,10,12,96,304,639,2052,2060,2097,2940,5586,9087,10550,38988,42622,
%T A336892 84380,128030,199694,255240,342411,346044,515316,673233,721035,
%U A336892 1053700,1361943,2149875,4206049,5739687,6979316,10896431,15904273,138156772,144608991,276866005
%N A336892 Numbers that are a divisor of the sum of their divisors to their own powers.
%C A336892 As n is a divisor of n^n this sequence is also the numbers that are a divisor of the sum of their proper divisors to their own powers.
%C A336892 Integers k such that k divides A062796(k). - _Michel Marcus_, Aug 07 2020
%C A336892 a(36) > 280 million if it exists. - _David A. Corneth_, Aug 10 2020
%e A336892 10 is a term as the divisors of 10 are 1,2,5,10 and 1^1+2^2+5^5+10^10 = 3130 + 10^10 which is divisible by 10.
%e A336892 12 is a term as the divisors of 12 are 1,2,3,4,6,12 and 1^1+2^2+3^3+4^4+6^6+12^12 = 46944 + 12^12 which is divisible by 12.
%t A336892 seqQ[n_] := Divisible[DivisorSum[n, PowerMod[#, #, n] &], n]; Select[Range[10^5], seqQ] (* _Amiram Eldar_, Aug 10 2020 *)
%o A336892 (PARI) isokb(k) = ! sumdiv(k, d, if (d<k, Mod(d, k)^d)); \\ _Michel Marcus_, Aug 10 2020
%Y A336892 Cf. A032741, A000005, A001065, A032742, A062796.
%K A336892 nonn
%O A336892 1,2
%A A336892 _Scott R. Shannon_, Aug 07 2020
%E A336892 a(19)-a(25) from _Amiram Eldar_, Aug 08 2020
%E A336892 a(26)-a(32) from _Michel Marcus_, Aug 10 2020
%E A336892 a(33)-a(35) from _David A. Corneth_, Aug 10 2020