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.

A199909 T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with zero sum, and adjacent elements not equal modulo three (with -1 modulo 3 = 2).

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 4
6 6
7 1
8 4
9 12
10 8
11 1
12 6
13 24
14 24
15 14
16 1
17 8
18 42
19 72
20 82
21 32
22 1
23 8
24 60
25 152
26 256
27 232
28 56
29 1
30 10
31 84
32 256
33 804
34 1312
35 654
36 100
37 1
38 12
39 114
40 448
41 1836
42 5016
43 5206
44 2044
45 204
46 1
47 12
48 144
49 680
50 3196
51 12872
52 24864
53 21208
54 6096
55 388
56 1
57 14
58 180
59 952
60 6064
61 29864
62 77874

List of values

[1, 1, 2, 1, 4, 6, 1, 4, 12, 8, 1, 6, 24, 24, 14, 1, 8, 42, 72, 82, 32, 1, 8, 60, 152, 256, 232, 56, 1, 10, 84, 256, 804, 1312, 654, 100, 1, 12, 114, 448, 1836, 5016, 5206, 2044, 204, 1, 12, 144, 680, 3196, 12872, 24864, 21208, 6096, 388, 1, 14, 180, 952, 6064, 29864, 77874]