The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A053450 Multiplicative order of 7 mod n, where gcd(n,7) = 1. 3

%I

%S 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,

%T 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,

%U 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

%N Multiplicative order of 7 mod n, where gcd(n,7) = 1.

%C Essentially the same as A050979. [_R. J. Mathar_, Oct 13 2008]

%H Muniru A Asiru, <a href="/A053450/b053450.txt">Table of n, a(n) for n = 1..10000</a>

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

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

%o (GAP) List(Filtered([1..120],n->Gcd(n,7)=1),n->OrderMod(7,n)); # _Muniru A Asiru_, Feb 25 2019

%K nonn

%O 1,4

%A _David W. Wilson_

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

Last modified April 21 06:10 EDT 2021. Contains 343146 sequences. (Running on oeis4.)