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.

A245995 T(n,k)=Number of length n+2 0..k arrays with no pair in any consecutive three terms totalling exactly k.

Table of values

n a(n)
1 2
2 8
3 2
4 28
5 12
6 2
7 64
8 68
9 18
10 2
11 126
12 208
13 164
14 26
15 2
16 216
17 534
18 676
19 396
20 38
21 2
22 344
23 1116
24 2262
25 2196
26 956
27 56
28 2
29 512
30 2120
31 5766
32 9582
33 7132
34 2308
35 82
36 2
37 730
38 3648
39 13064
40 29790
41 40590
42 23168
43 5572
44 120
45 2
46 1000
47 5930
48 25992
49 80504
50 153906
51 171942
52 75260

List of values

[2, 8, 2, 28, 12, 2, 64, 68, 18, 2, 126, 208, 164, 26, 2, 216, 534, 676, 396, 38, 2, 344, 1116, 2262, 2196, 956, 56, 2, 512, 2120, 5766, 9582, 7132, 2308, 82, 2, 730, 3648, 13064, 29790, 40590, 23168, 5572, 120, 2, 1000, 5930, 25992, 80504, 153906, 171942, 75260]