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.

A254204 T(n,k)=Number of length n 1..(k+2) arrays with no leading or trailing partial sum equal to a prime.

Table of values

n a(n)
1 1
2 2
3 0
4 2
5 1
6 0
7 3
8 1
9 2
10 0
11 3
12 4
13 4
14 6
15 1
16 4
17 4
18 17
19 9
20 11
21 0
22 5
23 11
24 18
25 54
26 21
27 27
28 0
29 6
30 16
31 47
32 59
33 176
34 47
35 53
36 1
37 6
38 23
39 68
40 195
41 204
42 610
43 118
44 133
45 0
46 7
47 23
48 119
49 315
50 898
51 769
52 2197
53 333
54 310
55 0
56 7
57 34
58 131
59 676
60 1653
61 4353
62 3098
63 8358
64 984
65 691
66 1
67 8
68 34
69 226
70 786
71 4078

List of values

[1, 2, 0, 2, 1, 0, 3, 1, 2, 0, 3, 4, 4, 6, 1, 4, 4, 17, 9, 11, 0, 5, 11, 18, 54, 21, 27, 0, 6, 16, 47, 59, 176, 47, 53, 1, 6, 23, 68, 195, 204, 610, 118, 133, 0, 7, 23, 119, 315, 898, 769, 2197, 333, 310, 0, 7, 34, 131, 676, 1653, 4353, 3098, 8358, 984, 691, 1, 8, 34, 226, 786, 4078]