|
| |
|
|
A122095
|
|
Primes for which 8p+1 divides 2^p-1.
|
|
1
| |
|
|
11, 29, 179, 239, 431, 761, 857, 941, 1367, 1667, 1871, 1877, 2411, 2837, 3041, 3119, 3329, 3347, 3767, 4289, 5021, 5087, 5231, 5261, 5717, 5861, 6449, 6917, 6959, 7079, 7211, 7919, 8429, 8741, 8867, 9341, 9461, 9851, 10211, 10979, 12107, 12437, 12479
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| The first 962 terms, all those with n<500000, are also in A023228. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 20 2006
All terms are in A023228, i.e. such that 8p+1 is prime, since a divisor of 8p+1 would also divide M(p)=A000225(p) and thus be of the form 2kp+1, but it is easily checked that 8p+1 cannot be a multiple of 2p+1 (nor of 4p+1 or 6p+1, of course). - M. F. Hasler, Mar 21 2011
|
|
|
EXAMPLE
| 29 is in this sequence because 2^29-1 is divisible by 8 * 29 + 1 = 233
|
|
|
MAPLE
| isA122095 := proc(n) RETURN( isprime(n) and ( (2^n-1) mod (8*n+1)) = 0 ) ; end: n := 1 : for a from 2 to 500000 do if isA122095(a) then print(n, a) ; n := n+1 ; fi ; od ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 20 2006
|
|
|
PROG
| (PARI) forprime( p=1, 1e4, Mod(2, p*8+1)^p-1 | print1(p", "))
|
|
|
CROSSREFS
| Cf. A000225, A002515, A188130.
Sequence in context: A115972 A099109 A024831 * A027758 A057739 A146751
Adjacent sequences: A122092 A122093 A122094 * A122096 A122097 A122098
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| J. Lowell (jhbubby(AT)mindspring.com), Oct 17 2006
|
|
|
EXTENSIONS
| More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 20 2006
|
| |
|
|
