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.

A250167 T(n,k)=Number of length n+1 0..k arrays with the sum of adjacent differences multiplied by some arrangement of +-1 equal to zero.

Table of values

n a(n)
1 2
2 3
3 4
4 4
5 11
6 8
7 5
8 20
9 37
10 16
11 6
12 33
13 96
14 119
15 32
16 7
17 48
18 211
19 436
20 373
21 64
22 8
23 67
24 380
25 1269
26 1880
27 1151
28 128
29 9
30 88
31 639
32 2860
33 7109
34 7836
35 3517
36 256
37 10
38 113
39 976
40 5831
41 19896
42 37881
43 32032
44 10679
45 512
46 11
47 140
48 1437
49 10460
50 49037
51 129648
52 195927

List of values

[2, 3, 4, 4, 11, 8, 5, 20, 37, 16, 6, 33, 96, 119, 32, 7, 48, 211, 436, 373, 64, 8, 67, 380, 1269, 1880, 1151, 128, 9, 88, 639, 2860, 7109, 7836, 3517, 256, 10, 113, 976, 5831, 19896, 37881, 32032, 10679, 512, 11, 140, 1437, 10460, 49037, 129648, 195927]