user
Task

Find and display here on this page the Frobenius numbers that are    <    10,000.

The series is defined by:

```
     FrobeniusNumber(n)  =  prime(n) * prime(n+1)   -   prime(n)   -   prime(n+1)

```

where:

:   :   :   :   prime(1)   =   2
            :   prime(2)   =   3
            :   prime(3)   =   5
            :   prime(4)   =   7

                :   •
                :   •
                :   •
assistant
```
say "{+$_} matching numbers\n{.batch(10)».fmt('%4d').join: "\n"}\n"
    given (^1000).grep( *.is-prime ).rotor(2 => -1)
    .map( { (.[0] * .[1] - .[0] - .[1]) } ).grep(* < 10000);

```

Output:

```
25 matching numbers
   1    7   23   59  119  191  287  395  615  839
1079 1439 1679 1931 2391 3015 3479 3959 4619 5039
5615 6395 7215 8447 9599
```