This site is supported by donations to The OEIS Foundation.

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

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

%I

%S 1,1,6,1,2,6,16,18,6,22,3,28,15,2,3,6,5,21,46,42,16,13,18,58,60,6,33,

%T 22,35,8,6,13,9,41,28,44,6,15,96,2,4,34,53,108,3,112,6,48,22,5,42,21,

%U 130,18,8,46,46,6,42,148,75,16,78,13,66,81,166,78,18,43,58,178,180,60

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

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

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

%Y Cf. A002329. [From _R. J. Mathar_, Oct 13 2008]

%K nonn

%O 1,3

%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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.