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.

A200192 T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with zero sum, adjacent elements differing by more than one, and elements alternately increasing and decreasing.

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 4
6 0
7 1
8 6
9 6
10 2
11 1
12 8
13 14
14 14
15 0
16 1
17 10
18 28
19 48
20 24
21 2
22 1
23 12
24 44
25 120
26 144
27 54
28 0
29 1
30 14
31 66
32 242
33 506
34 482
35 104
36 2
37 1
38 16
39 90
40 426
41 1298
42 2240
43 1534
44 230
45 0
46 1
47 18
48 120
49 688
50 2794
51 7266
52 9856
53 5148
54 464
55 2
56 1
57 20
58 152
59 1040
60 5300
61 18838
62 40632
63 44562
64 16826

List of values

[1, 1, 2, 1, 4, 0, 1, 6, 6, 2, 1, 8, 14, 14, 0, 1, 10, 28, 48, 24, 2, 1, 12, 44, 120, 144, 54, 0, 1, 14, 66, 242, 506, 482, 104, 2, 1, 16, 90, 426, 1298, 2240, 1534, 230, 0, 1, 18, 120, 688, 2794, 7266, 9856, 5148, 464, 2, 1, 20, 152, 1040, 5300, 18838, 40632, 44562, 16826]