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!)
 A226963 Numbers n such that 1^n + 2^n + 3^n + ... + n^n == 5 (mod n). 11
 1, 2, 5, 10, 30, 210, 9030, 235290, 11072512110 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Also, numbers n such that B(n)*n == 5 (mod n), where B(n) is the n-th Bernoulli number. Equivalently, SUM[prime p, (p-1) divides n] n/p == -5 (mod n). - Max Alekseyev, Aug 26 2013 There are no other terms below 10^31. - Max Alekseyev, Apr 04 2018 LINKS M. A. Alekseyev, J. M. Grau, A. M. Oller-Marcen. Computing solutions to the congruence 1^n + 2^n + ... + n^n == p (mod n). Discrete Applied Mathematics, 2018. doi:10.1016/j.dam.2018.05.022 arXiv:1602.02407 [math.NT] MATHEMATICA Select[Range[10000], Mod[Sum[PowerMod[i, #, #], {i, #}], #] == 5 &] PROG (PARI) is(n)=Mod(sumdiv(n, d, if(isprime(d+1), n/(d+1))), n)==-5 \\ Charles R Greathouse IV, Nov 13 2013 CROSSREFS Cf. A031971. Solutions to 1^n+2^n+...+n^n == m (mod n): A005408 (m=0), A014117 (m=1), A226960 (m=2), A226961 (m=3), A226962 (m=4), this sequence (m=5), A226964 (m=6), A226965 (m=7), A226966 (m=8), A226967 (m=9), A280041 (m=19), A280043 (m=43), A302343 (m=79), A302344 (m=193). Sequence in context: A239630 A239629 A155580 * A018386 A270521 A089073 Adjacent sequences:  A226960 A226961 A226962 * A226964 A226965 A226966 KEYWORD nonn,more AUTHOR José María Grau Ribas, Jun 24 2013 EXTENSIONS Terms 1,2,5 prepended and a(9) added by Max Alekseyev, Aug 26 2013 STATUS approved

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 16 21:55 EDT 2021. Contains 345080 sequences. (Running on oeis4.)