Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A070674
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A070674 Smallest m in range 2..n-1 such that m^9 == 1 mod n, or 1 if no such number exists. +0
1
1, 1, 1, 1, 1, 1, 2, 1, 4, 1, 1, 1, 3, 9, 1, 1, 1, 7, 4, 1, 4, 1, 1, 1, 1, 3, 4, 9, 1, 1, 5, 1, 1, 1, 11, 13, 7, 5, 16, 1, 1, 25, 6, 1, 16, 1, 1, 1, 18, 1, 1, 9, 1, 7, 1, 9, 4, 1, 1, 1, 13, 5, 4, 1, 16, 1, 29, 1, 1, 11, 1, 25, 2, 7, 1, 5, 23, 55, 23, 1, 10, 1, 1, 25, 1 (list; graph; listen)
OFFSET

1,7

CROSSREFS

Sequence in context: A140505 A117971 A131642 this_sequence A070668 A072341 A011130

Adjacent sequences: A070671 A070672 A070673 this_sequence A070675 A070676 A070677

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), May 08 2002

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research