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.

Table of values

n a(n)
1 3
2 5
3 7
4 11
5 13
6 17
7 19
8 31
9 37
10 41
11 61
12 73
13 97
14 109
15 151
16 241
17 257
18 331

List of values

[3, 5, 7, 11, 13, 17, 19, 31, 37, 41, 61, 73, 97, 109, 151, 241, 257, 331]