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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053450 Multiplicative order of 7 mod n, where gcd(n, 7) = 1. 2
1, 1, 1, 2, 4, 1, 2, 3, 4, 10, 2, 12, 4, 2, 16, 3, 3, 4, 10, 22, 2, 4, 12, 9, 7, 4, 15, 4, 10, 16, 6, 9, 3, 12, 4, 40, 6, 10, 12, 22, 23, 2, 4, 16, 12, 26, 9, 20, 3, 7, 29, 4, 60, 15, 8, 12, 10, 66, 16, 22, 70, 6, 24, 9, 4, 6, 12, 78, 4, 27, 40, 41, 16, 6, 7, 10, 88, 12, 22, 15, 23, 12, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

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

LINKS

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

MATHEMATICA

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

PROG

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

CROSSREFS

Sequence in context: A112229 A087419 A050979 * A215905 A269065 A206475

Adjacent sequences:  A053447 A053448 A053449 * A053451 A053452 A053453

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 01:25 EDT 2017. Contains 292500 sequences.