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!)
A186305 n^((p-1)/2) (mod p) for p = 29. 2

%I #20 Mar 21 2013 16:21:18

%S 0,1,28,28,1,1,1,1,28,1,28,28,28,1,28,28,1,28,28,28,1,28,1,1,1,1,28,

%T 28,1,0,1,28,28,1,1,1,1,28,1,28,28,28,1,28,28,1,28,28,28,1,28,1,1,1,1,

%U 28,28,1,0,1,28,28,1,1,1,1,28,1,28,28,28,1,28,28,1,28

%N n^((p-1)/2) (mod p) for p = 29.

%t p = 29; Table[PowerMod[n, (p-1)/2, p], {n, 0, 100}]

%Y Cf. A186293-A186304.

%K nonn

%O 0,3

%A _Marco Matosic_, Feb 17 2011

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 April 18 18:58 EDT 2024. Contains 371781 sequences. (Running on oeis4.)