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!)
A175866 Numbers k such that 2^(k-1) == 1 (mod k) and 2^(k-1) == 3*k + 1 (mod k^2). 0

%I #10 Aug 20 2023 21:04:27

%S 5,13,19,173,5501

%N Numbers k such that 2^(k-1) == 1 (mod k) and 2^(k-1) == 3*k + 1 (mod k^2).

%Y Cf. A124924.

%K nonn,more

%O 1,1

%A _Alzhekeyev Ascar M_, Sep 30 2010

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 April 25 10:51 EDT 2024. Contains 371967 sequences. (Running on oeis4.)