This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A269326 #18 Sep 08 2022 08:46:15 %S A269326 3,5,7,11,13,17,19,31,37,41,61,73,97,109,151,241,257,331 %N 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. %H A269326 Fred Cohen and J. L. Selfridge, <a href="http://dx.doi.org/10.1090/S0025-5718-1975-0376583-0">Not every number is the sum or difference of two prime powers</a>, Math. Comput. 29 (1975), pp. 79-81. %o A269326 (Magma) PrimeDivisors((2^36-1)*(2^48-1)*(2^60-1))[1..18]; %Y A269326 Cf. A076335, A076336, A101036. %K A269326 nonn,fini,full %O A269326 1,1 %A A269326 _Arkadiusz Wesolowski_, Feb 23 2016