login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A091330 a(n) = ((p-1)!/p) - ((p-1)*(p-1)!/p!), where p is the n-th prime. 2
0, 0, 4, 102, 329890, 36846276, 1230752346352, 336967037143578, 48869596859895986086, 10513391193507374500051862068, 8556543864909388988268015483870, 10053873697024357228864849950022572972972 (list; graph; refs; listen; history; text; 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! = (p-1)!/p - (p-1)/p.
Also, a(n) = floor((p-1)!/p). [Bruno Berselli, May 31 2013]
If b(1)=1, and b(m) = ((m-1)^2 / m) *(b(m-1)+(m-3)/(m-1)) for m>1, then a(n) are the terms of b(m) for m prime. [Pedro Caceres, Dec 30 2018]
LINKS
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!)] (* Robert G. Wilson v, Mar 02 2004 *)
CROSSREFS
Cf. A007619.
Sequence in context: A180818 A211047 A326087 * A353312 A024056 A353311
KEYWORD
nonn,easy
AUTHOR
Russell Easterly, Mar 01 2004
EXTENSIONS
More terms from Robert G. Wilson v and Ray Chandler, Mar 02 2004
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)