|
%I #14 Jun 19 2021 17:09:43
%S 0,0,1,17,32989,3070523,76922021647,18720390952421,
%T 2221345311813453913,375478256910977660716137931,
%U 285218128830312966275600516129,279274269361787700801801387500627027027,497509319053596179479031261948851155043902439,777965735189855979259768884963738410817488372093
%N Let p = n-th prime; sequence gives ((p-2)!-1)/p.
%C A variant of Wilson's theorem says that this is always an integer.
%H Harry J. Smith, <a href="/A066161/b066161.txt">Table of n, a(n) for n=1..50</a>
%H Ed Pegg, Jr., <a href="http://www.mathpuzzle.com">Math. Puzzles</a>
%p A066161:=n->((ithprime(n)-2)!-1)/ithprime(n): seq(A066161(n), n=1..15); # _Wesley Ivan Hurt_, Dec 01 2015
%t Table[((Prime[n] - 2)! - 1)/Prime[n], {n, 15}] (* _Wesley Ivan Hurt_, Dec 01 2015 *)
%t ((#-2)!-1)/#&/@Prime[Range[20]] (* _Harvey P. Dale_, Jun 19 2021 *)
%o (PARI) { for (n=1, 50, p=prime(n); write("b066161.txt", n, " ", ((p - 2)! - 1)/p) ) } \\ _Harry J. Smith_, Feb 03 2010
%K nonn,easy
%O 1,4
%A _N. J. A. Sloane_, Dec 13 2001
|
