Search: id:A002068
Results 1-1 of 1 results found.

%I A002068 M3728 N1524
%S A002068 1,1,0,5,1,0,5,2,8,18,19,7,16,13,6,34,27,56,12,69,11,73,20,70,70,72,57,
%T A002068 1,30,95,71,119,56,67,94,86,151,108,21,106,48,72,159,35,147,118,173,180,
%U A002068 113,131,169,107,196,214,177,73,121,170,25,277,164,231,271,259,288,110
%N A002068 Wilson remainders: a(n) = ((p-1)!+1)/p mod p, where p=prime(n).
%C A002068 If this is zero, p is a Wilson prime (see A007540).
%D A002068 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A002068 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%D A002068 R. Crandall and C. Pomerance, Prime Numbers: A Computational Perspective, 
               Springer, NY, 2001; see p. 29.
%D A002068 C.-E. Froberg, Investigation of the Wilson remainders in the interval 
               3<=p<=50,000, Arkiv f. Matematik, 4 (1961), 479-481.
%D A002068 K. Goldberg, A table of Wilson quotients and the third Wilson prime, 
               J. London Math. Soc., 28 (1953), 252-256.
%D A002068 J. Roberts, Lure of the Integers, Math. Assoc. America, 1992, p. 244.
%H A002068 T. D. Noe, <a href="b002068.txt">Table of n, a(n) for n = 1..2000</a>
%t A002068 Table[p=Prime[n]; Mod[((p-1)!+1)/p, p], {n,100}] - T. D. Noe (noe(AT)sspectra.com), 
               Mar 21 2006
%Y A002068 Sequence in context: A102259 A021200 A019904 this_sequence A021666 A143148 
               A081817
%Y A002068 Adjacent sequences: A002065 A002066 A002067 this_sequence A002069 A002070 
               A002071
%K A002068 nonn,nice,easy
%O A002068 1,4
%A A002068 N. J. A. Sloane (njas(AT)research.att.com).

Search completed in 0.001 seconds