The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A091858 a(n) = n! mod prime(n). 3

%I #16 Feb 18 2020 21:05:21

%S 1,2,1,3,10,5,8,2,9,1,22,7,4,40,29,16,23,60,48,51,49,24,74,40,15,85,3,

%T 41,16,42,119,43,51,73,14,23,150,49,104,20,128,44,185,66,146,159,178,

%U 150,44,51,48,4,134,143,118,143,242,141,149,108,115,205,306,196,292,242

%N a(n) = n! mod prime(n).

%C No term is 0. For positions of 1's see A067999.

%H Alois P. Heinz, <a href="/A091858/b091858.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Zak Seidov)

%t A091858[n_] := Block[{k = p = 1), m = Prime[n]}, While[p = Mod[p k, m]; k < n, k++ ]; p]; Table[ f[ n], {n, 66}] (* _Robert G. Wilson v_, Mar 16 2004 *)

%t Table[Mod[n!,Prime[n]],{n,70}] (* _Harvey P. Dale_, Mar 01 2015 *)

%Y Cf. A000040, A000142.

%K nonn

%O 1,2

%A _Amarnath Murthy_, Mar 13 2004

%E Corrected and extended by _Robert G. Wilson v_, Mar 16 2004

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 May 14 09:35 EDT 2024. Contains 372532 sequences. (Running on oeis4.)