login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082568 First root of A033949(n), i.e. smallest x such that x^2 == 1 mod A033949(n). 0
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 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

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.

Sequence in context: A189827 A023859 A096457 * A069918 A200700 A075380

Adjacent sequences:  A082565 A082566 A082567 * A082569 A082570 A082571

KEYWORD

nonn

AUTHOR

Jon Perry (perry(AT)globalnet.co.uk), May 06 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 03:33 EST 2012. Contains 205694 sequences.