Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A070679
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A070679 Smallest m in range 1..phi(n) such that 9^m == 1 mod n, or 0 if no such number exists. +0
12
0, 1, 0, 1, 2, 0, 3, 1, 0, 2, 5, 0, 3, 3, 0, 2, 8, 0, 9, 2, 0, 5, 11, 0, 10, 3, 0, 3, 14, 0, 15, 4, 0, 8, 6, 0, 9, 9, 0, 2, 4, 0, 21, 5, 0, 11, 23, 0, 21, 10, 0, 3, 26, 0, 10, 3, 0, 14, 29, 0, 5, 15, 0, 8, 6, 0, 11, 8, 0, 6, 35, 0, 6, 9, 0, 9, 15, 0, 39, 2, 0, 4, 41, 0 (list; graph; listen)
OFFSET

1,5

CROSSREFS

Cf. A070667-A070675, A002326, A070676, A053447, A070677, A070681, A070678, A053451, A070682, A070680, A070683.

Sequence in context: A143143 A158853 A054372 this_sequence A127374 A098862 A003988

Adjacent sequences: A070676 A070677 A070678 this_sequence A070680 A070681 A070682

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com) and Amarnath Murthy (amarnath_murthy(AT)yahoo.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 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research