cp's OEIS Frontend

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.

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.

Original entry on oeis.org

3, 5, 7, 11, 13, 17, 19, 31, 37, 41, 61, 73, 97, 109, 151, 241, 257, 331
Offset: 1

Views

Author

Arkadiusz Wesolowski, Feb 23 2016

Keywords

Crossrefs

Programs

  • Magma
    PrimeDivisors((2^36-1)*(2^48-1)*(2^60-1))[1..18];