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.

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

Table of values

n a(n)
1 1
2 2
3 1
4 2
5 2
6 1
7 3
8 4
9 4
10 1
11 3
12 8
13 10
14 6
15 1
16 4
17 9
18 26
19 21
20 8
21 1
22 5
23 17
24 33
25 81
26 47
27 14
28 1
29 6
30 24
31 75
32 120
33 261
34 102
35 19
36 1
37 6
38 32
39 121
40 342
41 480
42 936
43 256
44 33
45 1
46 7
47 36
48 191
49 653
50 1707
51 2079
52 3435
53 754
54 69
55 1
56 7
57 48
58 242
59 1221
60 3764
61 8814
62 9044
63 12406
64 2169
65 162
66 1
67 8
68 52
69 374

List of values

[1, 2, 1, 2, 2, 1, 3, 4, 4, 1, 3, 8, 10, 6, 1, 4, 9, 26, 21, 8, 1, 5, 17, 33, 81, 47, 14, 1, 6, 24, 75, 120, 261, 102, 19, 1, 6, 32, 121, 342, 480, 936, 256, 33, 1, 7, 36, 191, 653, 1707, 2079, 3435, 754, 69, 1, 7, 48, 242, 1221, 3764, 8814, 9044, 12406, 2169, 162, 1, 8, 52, 374]