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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A280043 Solutions to the congruence 1^n+2^n+...+n^n == 43 (mod n). 11
1, 2, 6, 42, 43, 86, 258, 77658 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..8.

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

f[n_] := Mod[Sum[PowerMod[k, n, n], {k, 1, n}] - 43, n];

For[n = 1, n < 80000, n++, If[f[n] == 0, Print[n]]] (* Jean-Fran├žois Alcover, Sep 06 2018 *)

CROSSREFS

Sequence in context: A096138 A004153 A071440 * A309813 A033936 A203618

Adjacent sequences:  A280040 A280041 A280042 * A280044 A280045 A280046

KEYWORD

nonn,fini,full

AUTHOR

N. J. A. Sloane, Dec 29 2016

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 27 19:23 EST 2020. Contains 332308 sequences. (Running on oeis4.)