The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 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
 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, 31, 14, 23, 33, 22, 29, 17, 26, 37, 34, 25, 9, 13, 16, 28, 21, 19, 27, 45, 32, 39, 17, 10, 49, 35, 25, 29, 53, 21, 38, 15, 37, 24, 57, 53, 50, 11, 40, 61, 55, 63, 44 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Alois P. Heinz, Table of n, a(n) for n = 1..10000 EXAMPLE a(3) = 4 because A033949(3) = 15 and 4^2 = 16 == 1 mod 15 is the first integer to do so. PROG (PARI) for (n=3, 100, for (j=2, n-2, if (j^2%n==1, print1(j", "); break))) CROSSREFS Cf. A033949. Column k=1 of A277776. Sequence in context: A023859 A096457 A277897 * A242640 A210195 A069918 Adjacent sequences:  A082565 A082566 A082567 * A082569 A082570 A082571 KEYWORD nonn AUTHOR Jon Perry, May 06 2003 EXTENSIONS Offset corrected, name clarified and more terms from Alois P. Heinz, Oct 30 2016 STATUS approved

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 December 3 13:27 EST 2021. Contains 349463 sequences. (Running on oeis4.)