login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A003559 Least number m such that 3^m == +- 1 (mod 3n + 1). 0
1, 3, 2, 3, 4, 9, 5, 10, 3, 15, 8, 9, 4, 21, 11, 21, 6, 20, 14, 5, 16, 11, 12, 6, 9, 39, 4, 16, 10, 6, 23, 24, 20, 17, 26, 27, 12, 44, 29, 5, 15, 63, 12, 9, 16, 69, 35, 14, 9, 25, 30, 39, 8, 81, 41, 39, 21, 60, 44, 45, 22, 80, 36, 8, 21, 99, 50, 8, 12, 105, 53 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
MATHEMATICA
Table[Module[{m=1}, While[PowerMod[3, m, 3n+1]!=1&&PowerMod[3, m, 3n+1] != 3n, m++]; m], {n, 60}] (* Harvey P. Dale, Jul 29 2018 *)
CROSSREFS
Sequence in context: A334449 A268289 A201907 * A200599 A239947 A173093
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 28 18:07 EDT 2024. Contains 372092 sequences. (Running on oeis4.)