This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A228919 Numbers n such that 1^(n+1) + 2^(n+1) + ... + n^(n+1) == 0 (mod n). 4
 1, 4, 5, 7, 8, 11, 12, 13, 16, 17, 19, 20, 23, 24, 25, 28, 29, 31, 32, 36, 37, 40, 41, 43, 44, 47, 48, 49, 52, 53, 56, 59, 60, 61, 64, 65, 67, 68, 71, 72, 73, 76, 79, 80, 83, 84, 85, 88, 89, 91, 92, 96, 97, 100, 101, 103, 104, 107, 108, 109, 112, 113, 116 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Charles R Greathouse IV, Table of n, a(n) for n = 1..10000 MATHEMATICA f[n_] := Mod[Sum[PowerMod[i, n + 1, n], {i, 1, n}], n]; Select[Range[1000], f[#] == 0 &] PROG (PARI) is(n)=my(m=n+1); sum(k=1, n, Mod(k, n)^m)==0 \\ Charles R Greathouse IV, Nov 20 2013 CROSSREFS Cf. A191677, A121706. Sequence in context: A159698 A288931 A191276 * A047377 A188265 A032714 Adjacent sequences:  A228916 A228917 A228918 * A228920 A228921 A228922 KEYWORD nonn AUTHOR José María Grau Ribas, Sep 08 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 11:12 EDT 2019. Contains 324152 sequences. (Running on oeis4.)