|
|
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
|
|
|
MAPLE
|
|
|
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
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|