user
Task

Let **p(i)** be a sequence of prime numbers. such that 2=p(1), 3=p(2), 5=p(3), ...
  
Consider the **p(1),p(3),p(5), ... ,p(i)**, for each **p(i) < 1,000** and **i** is odd.
  
Let **sum** be any prefix sum of these primesa.
  
If **sum** is prime then print **i**, **p(i)** and **sum**.
assistant
```
my @odd  = grep { ++$ !%% 2 }, grep &is-prime, 2 ..^ 1000;
my @sums = [\+] @odd;

say .fmt('%5d') for grep { .[2].is-prime }, ( (1,3…*) Z @odd Z @sums );

```

Output:

```
    1     2     2
    3     5     7
   11    31    89
   27   103   659
   35   149  1181
   67   331  5021
   91   467  9923
   95   499 10909
   99   523 11941
  119   653 17959
  143   823 26879
```