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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A066161 Let p = n-th prime; sequence gives ((p-2)!-1)/p. 2
 0, 0, 1, 17, 32989, 3070523, 76922021647, 18720390952421, 2221345311813453913, 375478256910977660716137931, 285218128830312966275600516129, 279274269361787700801801387500627027027, 497509319053596179479031261948851155043902439, 777965735189855979259768884963738410817488372093 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS A variant of Wilson's theorem says that this is always an integer. LINKS Harry J. Smith, Table of n, a(n) for n=1..50 Ed Pegg, Jr., Math. Puzzles MAPLE A066161:=n->((ithprime(n)-2)!-1)/ithprime(n): seq(A066161(n), n=1..15); # Wesley Ivan Hurt, Dec 01 2015 MATHEMATICA Table[((Prime[n] - 2)! - 1)/Prime[n], {n, 15}] (* Wesley Ivan Hurt, Dec 01 2015 *) PROG (PARI) { for (n=1, 50, p=prime(n); write("b066161.txt", n, " ", ((p - 2)! - 1)/p) ) } \\ Harry J. Smith, Feb 03 2010 CROSSREFS Sequence in context: A178050 A110915 A068733 * A125040 A125042 A138942 Adjacent sequences:  A066158 A066159 A066160 * A066162 A066163 A066164 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, Dec 13 2001 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 February 26 17:19 EST 2020. Contains 332293 sequences. (Running on oeis4.)