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!)
A003565 Least number m such that 9^m == +- 1 (mod 9n + 1). 0

%I #10 Oct 22 2023 16:46:10

%S 1,9,3,9,11,10,8,3,2,3,10,27,29,63,8,7,15,81,21,45,18,99,6,15,28,46,5,

%T 55,65,15,6,68,37,17,39,30,83,147,20,171,18,189,24,99,42,82,26,27,24,

%U 20,22,33,119,243,30,25,64,29,9,135,10,21,35,12,73,24,25

%N Least number m such that 9^m == +- 1 (mod 9n + 1).

%K nonn

%O 1,2

%A _N. J. A. Sloane_

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 August 11 19:17 EDT 2024. Contains 375073 sequences. (Running on oeis4.)