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.

A240039 T(n,k)=Number of nXk 0..2 arrays with no element equal to zero plus the sum of elements to its left or zero plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 3.

Table of values

n a(n)
1 2
2 2
3 2
4 4
5 2
6 4
7 4
8 6
9 6
10 4
11 8
12 4
13 16
14 4
15 8
16 8
17 10
18 16
19 16
20 10
21 8
22 16
23 8
24 42
25 18
26 42
27 8
28 16
29 16
30 20
31 44
32 52
33 52
34 44
35 20
36 16
37 32
38 16
39 114
40 62
41 154
42 62
43 114
44 16
45 32
46 32
47 40
48 122
49 162
50 178
51 178
52 162
53 122
54 40
55 32
56 64
57 32
58 314
59 204
60 494
61 282
62 494
63 204
64 314
65 32
66 64
67 64
68 80
69 340
70 530
71 600

List of values

[2, 2, 2, 4, 2, 4, 4, 6, 6, 4, 8, 4, 16, 4, 8, 8, 10, 16, 16, 10, 8, 16, 8, 42, 18, 42, 8, 16, 16, 20, 44, 52, 52, 44, 20, 16, 32, 16, 114, 62, 154, 62, 114, 16, 32, 32, 40, 122, 162, 178, 178, 162, 122, 40, 32, 64, 32, 314, 204, 494, 282, 494, 204, 314, 32, 64, 64, 80, 340, 530, 600]