OFFSET
1,3
COMMENTS
According to the two theorems (Fermat and Wilson), k + 1 divides(k^k + k!) because k^k == 1 (mod k + 1) and k! == - 1 (mod k + 1) for any prime k + 1.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..50
EXAMPLE
a(3) = 14 because prime(3) = 5 => p = 4 => (4^4 + 4!) / 4(4 + 1) = 280/20 = 14.
MAPLE
with(numtheory): for n from 1 to 20 do: p:=ithprime(n):q:=p-1:x:= (q^q + q!)/(q*p):
printf(`%d, `, x): od:
MATHEMATICA
f[n_] := Block[{k = Prime@ n - 1}, (k^k + k!)/(k (k + 1))]; Array[f, 10] (* Robert G. Wilson v, Jan 05 2011 *)
PROG
(PARI) a(n)={my(k=prime(n)-1); (k^k + k!) / (k*(k + 1))} \\ Andrew Howroyd, Apr 13 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Michel Lagneau, Jan 03 2011
EXTENSIONS
Terms a(11) and beyond from Andrew Howroyd, Apr 13 2021
STATUS
approved