|
| |
|
|
A091330
|
|
a(n) = ((p-1)!/p) - ((p-1)*(p-1)!/p!), where p is the n-th prime.
|
|
1
| |
|
|
0, 0, 4, 102, 329890, 36846276, 1230752346352, 336967037143578, 48869596859895986086, 10513391193507374500051862068, 8556543864909388988268015483870, 10053873697024357228864849950022572972972
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
COMMENTS
| Related to Wilson's Theorem. Let p be a prime number and write 1/p - (p-1)/p! = x/(p-1)!. Then x = (p-1)!/p - (p-1)*(p-1)!/p!.
|
|
|
EXAMPLE
| Prime(4)=7 so a(4) = 6!/7 - 6*6!/7! = 102
|
|
|
MATHEMATICA
| A091330[n_] := Block[{p = Prime[n]}, ((p - 1)!/p) - ((p - 1)*(p - 1)!/p!)] (from Robert G. Wilson v 02 2004)
|
|
|
CROSSREFS
| Cf. A007619.
Sequence in context: A129435 A129702 A180818 * A024056 A102439 A006415
Adjacent sequences: A091327 A091328 A091329 * A091331 A091332 A091333
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Russell A. Easterly (logiclab(AT)comcast.net), Mar 01 2004
|
|
|
EXTENSIONS
| More terms from Robert G. Wilson v (rgwv(AT)rgwv.com) and Ray Chandler (rayjchandler(AT)sbcglobal.net), Mar 02 2004
|
| |
|
|
