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.

A183483 T(n,k)=Number of nXk 0..2 arrays with every element equal to either the sum mod 3 of its vertical neighbors or the sum mod 3 of its horizontal neighbors.

Table of values

n a(n)
1 1
2 3
3 3
4 5
5 15
6 5
7 7
8 39
9 39
10 7
11 13
12 135
13 117
14 135
15 13
16 23
17 495
18 587
19 587
20 495
21 23
22 37
23 1647
24 2925
25 4015
26 2925
27 1647
28 37
29 63
30 5751
31 12131
32 40073
33 40073
34 12131
35 5751
36 63
37 109
38 20223
39 58333
40 270549
41 706473
42 270549
43 58333
44 20223
45 109
46 183
47 70119
48 270611

List of values

[1, 3, 3, 5, 15, 5, 7, 39, 39, 7, 13, 135, 117, 135, 13, 23, 495, 587, 587, 495, 23, 37, 1647, 2925, 4015, 2925, 1647, 37, 63, 5751, 12131, 40073, 40073, 12131, 5751, 63, 109, 20223, 58333, 270549, 706473, 270549, 58333, 20223, 109, 183, 70119, 270611]