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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053446 Multiplicative order of 3 mod n, where gcd(n, 3) = 1. 9
1, 1, 2, 4, 6, 2, 4, 5, 3, 6, 4, 16, 18, 4, 5, 11, 20, 3, 6, 28, 30, 8, 16, 12, 18, 18, 4, 8, 42, 10, 11, 23, 42, 20, 6, 52, 20, 6, 28, 29, 10, 30, 16, 12, 22, 16, 12, 35, 12, 18, 18, 30, 78, 4, 8, 41, 16, 42, 10, 88, 6, 22, 23, 36, 48, 42, 20, 100, 34, 6, 52, 53, 27, 20, 12, 112, 44 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

Essentially the same as A050975. [R. J. Mathar, Oct 13 2008]

LINKS

Table of n, a(n) for n=1..77.

MATHEMATICA

MultiplicativeOrder[3, #] & /@ Select[ Range@ 115, GCD[3, #] == 1 &] (* Robert G. Wilson v, Apr 05 2011 *)

PROG

(PARI) lista(nn) = {for (n=1, nn, if (gcd(n, 3) == 1, print1(znorder(Mod(3, n)), ", ")); ); } \\ Michel Marcus, Feb 06 2015

CROSSREFS

Sequence in context: A075242 A161489 A050975 * A133903 A278263 A236188

Adjacent sequences:  A053443 A053444 A053445 * A053447 A053448 A053449

KEYWORD

nonn

AUTHOR

David W. Wilson

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified September 26 10:36 EDT 2017. Contains 292518 sequences.