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.

A254218 T(n,k) = number of length n 1..(k+2) arrays with no leading or trailing partial sum equal to a prime and no consecutive values equal.

Table of values

n a(n)
1 1
2 2
3 0
4 2
5 0
6 0
7 3
8 0
9 1
10 0
11 3
12 2
13 3
14 2
15 1
16 4
17 2
18 11
19 4
20 2
21 0
22 5
23 8
24 12
25 22
26 8
27 2
28 0
29 6
30 12
31 32
32 24
33 56
34 6
35 2
36 0
37 6
38 18
39 48
40 96
41 70
42 136
43 15
44 2
45 0
46 7
47 18
48 86
49 168
50 373
51 192
52 383
53 18
54 5
55 0
56 7
57 28
58 98
59 388
60 766
61 1472
62 633
63 1070
64 45
65 4
66 0
67 8
68 28
69 172
70 490
71 2056
72 3720
73 6490
74 2484
75 3897

List of values

[1, 2, 0, 2, 0, 0, 3, 0, 1, 0, 3, 2, 3, 2, 1, 4, 2, 11, 4, 2, 0, 5, 8, 12, 22, 8, 2, 0, 6, 12, 32, 24, 56, 6, 2, 0, 6, 18, 48, 96, 70, 136, 15, 2, 0, 7, 18, 86, 168, 373, 192, 383, 18, 5, 0, 7, 28, 98, 388, 766, 1472, 633, 1070, 45, 4, 0, 8, 28, 172, 490, 2056, 3720, 6490, 2484, 3897]