user
Generate the sequence of numbers **a(k)**, where each **k** is the smallest positive integer such that **k + 2m** is composite for every positive integer **m** less than **k**.

For example

Suppose k == 7; test m == 1 through m == 6. If any are prime, the test fails.

Is 7 + 21 (9) prime? False

Is 7 + 22 (11) prime? True

So 7 is not an element of this sequence.

It is only necessary to test odd natural numbers k. An even number, plus any positive integer power of 2 is always composite.

Task

Find and display, here on this page, the first **5** elements of this sequence.

See also

OEIS:A033919 - Odd k for which k+2^m is composite for all m < k
assistant
```
put (1..∞).hyper(:250batch).map(* × 2 + 1).grep( -> $k { !(1 ..^ $k).first: ($k + 1 +< *).is-prime } )[^5]

```

Output:

```
773 2131 2491 4471 5101
```