The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A341437 Numbers k such that k divides Sum_{j=0..k} j^(k-j). 4

%I

%S 1,2,6,7,9,42,46,431,1806,2506,11318,16965,25426,33146,33361,37053,

%T 49365,99221,224506,359703,436994

%N Numbers k such that k divides Sum_{j=0..k} j^(k-j).

%C Numbers k such that k divides A026898(k-1).

%C a(19) > 10^5.

%F 0^6 + 1^5 + 2^4 + 3^3 + 4^2 + 5^1 + 6^0 = 66 = 6 * 11. So 6 is a term.

%t Do[If[Mod[Sum[PowerMod[k, n - k, n], {k, 0, n}], n] == 0, Print[n]], {n, 1, 3000}] (* _Vaclav Kotesovec_, Feb 12 2021 *)

%o (PARI) isok(n) = sum(k=0, n, Mod(k, n)^(n-k))==0;

%Y Cf. A026898, A128981, A188775, A341436.

%K nonn,more

%O 1,2

%A _Seiichi Manyama_, Feb 11 2021

%E a(19) from _Vaclav Kotesovec_, Feb 14 2021

%E a(20)-a(21) from _Chai Wah Wu_, Feb 15 2021

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 24 17:11 EDT 2021. Contains 345417 sequences. (Running on oeis4.)