login
A269326
Let k be a number which is simultaneously Sierpiński and Riesel, and let P be a set of primes which cover every number of the form k*2^m + 1 and of the form k*2^m - 1 with m >= 1. Sequence shows elements of the set P which has the property that the product of its primes is as small as it is possible.
1
3, 5, 7, 11, 13, 17, 19, 31, 37, 41, 61, 73, 97, 109, 151, 241, 257, 331
OFFSET
1,1
LINKS
Fred Cohen and J. L. Selfridge, Not every number is the sum or difference of two prime powers, Math. Comput. 29 (1975), pp. 79-81.
PROG
(Magma) PrimeDivisors((2^36-1)*(2^48-1)*(2^60-1))[1..18];
CROSSREFS
KEYWORD
nonn,fini,full
AUTHOR
STATUS
approved