The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A082568 First nontrivial square root of unity mod A033949(n), i.e., smallest x > 1 such that x^2 == 1 mod A033949(n). 4

%I

%S 3,5,4,7,9,8,5,13,11,15,10,6,17,14,9,13,21,19,7,16,25,21,13,20,11,8,

%T 31,14,23,33,22,29,17,26,37,34,25,9,13,16,28,21,19,27,45,32,39,17,10,

%U 49,35,25,29,53,21,38,15,37,24,57,53,50,11,40,61,55,63,44

%N First nontrivial square root of unity mod A033949(n), i.e., smallest x > 1 such that x^2 == 1 mod A033949(n).

%H Alois P. Heinz, <a href="/A082568/b082568.txt">Table of n, a(n) for n = 1..10000</a>

%e a(3) = 4 because A033949(3) = 15 and 4^2 = 16 == 1 mod 15 is the first integer to do so.

%o (PARI) for (n=3,100, for (j=2,n-2,if (j^2%n==1,print1(j","); break)))

%Y Cf. A033949.

%Y Column k=1 of A277776.

%K nonn

%O 1,1

%A _Jon Perry_, May 06 2003

%E Offset corrected, name clarified and more terms from _Alois P. Heinz_, Oct 30 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 27 06:18 EST 2022. Contains 350601 sequences. (Running on oeis4.)