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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070683 Smallest m in range 1..phi(2n+1) such that 12^m == 1 mod 2n+1, or 0 if no such number exists. 10
0, 0, 4, 6, 0, 1, 2, 0, 16, 6, 0, 11, 20, 0, 4, 30, 0, 12, 9, 0, 40, 42, 0, 23, 42, 0, 52, 4, 0, 29, 15, 0, 4, 66, 0, 35, 36, 0, 6, 26, 0, 41, 16, 0, 8, 6, 0, 12, 16, 0, 100, 102, 0, 53, 54, 0, 112, 44, 0, 48, 11, 0, 100, 126, 0, 65, 6, 0, 136, 138, 0, 2, 4, 0, 148 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

CROSSREFS

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

Sequence in context: A201529 A079207 A056945 * A195785 A184187 A106145

Adjacent sequences:  A070680 A070681 A070682 * A070684 A070685 A070686

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com) and Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 08 2002

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 16 13:12 EST 2012. Contains 205909 sequences.