Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082568
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082568 First root of A033949(n), i.e. smallest x such that x^2 == 1 mod A033949(n). +0
1
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; listen)
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.

PROGRAM

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

CROSSREFS

Cf. A033949.

Adjacent sequences: A082565 A082566 A082567 this_sequence A082569 A082570 A082571

Sequence in context: A107431 A023859 A096457 this_sequence A069918 A075380 A078439

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 15 20:12 EDT 2008. Contains 145099 sequences.


AT&T Labs Research