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.

A240381 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 zero plus the sum of the elements diagonally to its northwest, modulo 4.

Table of values

n a(n)
1 2
2 2
3 4
4 4
5 10
6 10
7 4
8 38
9 44
10 22
11 8
12 90
13 330
14 148
15 50
16 8
17 366
18 1494
19 2066
20 636
21 114
22 16
23 878
24 12234
25 17550
26 16994
27 2430
28 258
29 16
30 3606
31 57722
32 279886
33 281186
34 116030
35 9648
36 586
37 32
38 8666
39 477574
40 2545618
41 8802558
42 3502886
43 884792
44 37946
45 1330
46 32
47 35602

List of values

[2, 2, 4, 4, 10, 10, 4, 38, 44, 22, 8, 90, 330, 148, 50, 8, 366, 1494, 2066, 636, 114, 16, 878, 12234, 17550, 16994, 2430, 258, 16, 3606, 57722, 279886, 281186, 116030, 9648, 586, 32, 8666, 477574, 2545618, 8802558, 3502886, 884792, 37946, 1330, 32, 35602]