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.

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

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 3
6 3
7 1
8 4
9 6
10 4
11 1
12 5
13 13
14 16
15 7
16 1
17 6
18 22
19 56
20 40
21 10
22 1
23 7
24 38
25 171
26 261
27 84
28 15
29 1
30 8
31 65
32 530
33 1391
34 935
35 208
36 24
37 1
38 9
39 107
40 1495
41 7113
42 9079
43 4113
44 474
45 35
46 1
47 10
48 169
49 4059
50 31226
51 83658
52 70107
53 16724
54 1047
55 54
56 1
57 11
58 257
59 10121
60 131242
61 652346

List of values

[1, 1, 2, 1, 3, 3, 1, 4, 6, 4, 1, 5, 13, 16, 7, 1, 6, 22, 56, 40, 10, 1, 7, 38, 171, 261, 84, 15, 1, 8, 65, 530, 1391, 935, 208, 24, 1, 9, 107, 1495, 7113, 9079, 4113, 474, 35, 1, 10, 169, 4059, 31226, 83658, 70107, 16724, 1047, 54, 1, 11, 257, 10121, 131242, 652346]