The number of ways a number is a sum of consecutive primes Given an integer greater than 1, output the number of ways it can be expressed as the sum of one or more consecutive primes. 

Order of summands doesn't matter. A sum can consist of a single number (so the output for any prime will be at least 1.)

This is code-golf. Standard rules apply.

See this OEIS wiki for related information and sequences, including the sequence itself OEIS A054845.

Test cases

2 =&gt; 1
3 =&gt; 1
4 =&gt; 0
5 =&gt; 2
6 =&gt; 0
7 =&gt; 1
8 =&gt; 1
10 =&gt; 1
36 =&gt; 2
41 =&gt; 3
42 =&gt; 1
43 =&gt; 1
44 =&gt; 0
311 =&gt; 5
1151 =&gt; 4
34421 =&gt; 6
Jelly,  6  5 bytes
-1 thanks to dylnan
ÆRẆ§ċ

A monadic link
Try it online! Or see the test-suite (note the final test case would time out at 60s at TIO).
How?
ÆRẆ§ċ - Link: integer, n
ÆR    - primes from 2 to n inclusive
  Ẇ   - all contiguous substrings
   §  - sum each
    ċ - count occurrences of n