Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,11

CROSSREFS

Sequence in context: A030579 A030578 A030577 this_sequence A049586 A133721 A083202

Adjacent sequences: A070667 A070668 A070669 this_sequence A070671 A070672 A070673

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 December 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research