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.

A202076 T(n,k)=Number of arrays of n+2 integers in -k..k with sum zero and the sum of every adjacent pair being odd.

Table of values

n a(n)
1 2
2 4
3 4
4 10
5 20
6 2
7 14
8 56
9 26
10 0
11 24
12 120
13 78
14 0
15 6
16 30
17 220
18 264
19 0
20 96
21 12
22 44
23 364
24 504
25 0
26 1014
27 524
28 6
29 52
30 560
31 1128
32 0
33 3752
34 5832
35 726
36 0
37 70
38 816
39 1786
40 0
41 15010
42 34632
43 8412
44 0
45 20
46 80
47 1140
48 3262
49 0
50 35604
51 142692
52 80812
53 0
54 2760
55 40
56 102
57 1540
58 4660
59 0
60 95342

List of values

[2, 4, 4, 10, 20, 2, 14, 56, 26, 0, 24, 120, 78, 0, 6, 30, 220, 264, 0, 96, 12, 44, 364, 504, 0, 1014, 524, 6, 52, 560, 1128, 0, 3752, 5832, 726, 0, 70, 816, 1786, 0, 15010, 34632, 8412, 0, 20, 80, 1140, 3262, 0, 35604, 142692, 80812, 0, 2760, 40, 102, 1540, 4660, 0, 95342]