Numbers n such that gcd(n, 6) = 1, 2^(n-1) = 1 (mod n), and 2^(n-3) = 1 (mod (n-1)/2).
7, 11, 23, 31, 47, 59, 83, 107, 167, 179, 227, 263, 347, 359, 383, 467, 479, 503, 563
6 seqfan posts
Sun Aug 1 18:39:45 CEST 2010 [seqfan] Re: help needed editing A175625
Sun Aug 1 18:30:40 CEST 2010 [seqfan] Re: help needed editing A175625
Sun Aug 1 17:30:32 CEST 2010 [seqfan] Re: help needed editing A175625
Sun Aug 1 11:39:25 CEST 2010 [seqfan] Re: help needed editing A175625
Sat Jul 31 23:04:36 CEST 2010 [seqfan] Re: help needed editing A175625
Sat Jul 31 20:17:36 CEST 2010 [seqfan] help needed editing A175625
Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword
Links to OEIS content are included according to
The OEIS End-User License Agreement
.