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.

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

Table of values

n a(n)
1 1
2 2
3 1
4 2
5 3
6 1
7 3
8 5
9 8
10 2
11 3
12 10
13 15
14 20
15 4
16 4
17 11
18 40
19 45
20 50
21 6
22 5
23 20
24 49
25 160
26 135
27 126
28 11
29 6
30 28
31 105
32 222
33 670
34 421
35 329
36 20
37 6
38 37
39 163
40 576
41 1087
42 3001
43 1466
44 956
45 33
46 7
47 41
48 253
49 1026
50 3383
51 5604
52 13503
53 5403
54 2897
55 62
56 7
57 54
58 307
59 1849
60 6814
61 20393
62 29038
63 60408

List of values

[1, 2, 1, 2, 3, 1, 3, 5, 8, 2, 3, 10, 15, 20, 4, 4, 11, 40, 45, 50, 6, 5, 20, 49, 160, 135, 126, 11, 6, 28, 105, 222, 670, 421, 329, 20, 6, 37, 163, 576, 1087, 3001, 1466, 956, 33, 7, 41, 253, 1026, 3383, 5604, 13503, 5403, 2897, 62, 7, 54, 307, 1849, 6814, 20393, 29038, 60408]