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.

A239858 T(n,k)=Number of nXk 0..3 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 one plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4.

Table of values

n a(n)
1 2
2 2
3 2
4 4
5 3
6 4
7 6
8 9
9 5
10 6
11 8
12 12
13 44
14 4
15 8
16 14
17 29
18 78
19 84
20 5
21 14
22 20
23 63
24 255
25 203
26 130
27 5
28 20
29 30
30 100
31 742
32 1114
33 484
34 343
35 6
36 30
37 48
38 215
39 1382
40 3463
41 4549
42 1757
43 685
44 10
45 48
46 70
47 468
48 5647
49 9963
50 19065
51 28184
52 4979
53 1704
54 11
55 70
56 108
57 785
58 14755
59 71695
60 77212

List of values

[2, 2, 2, 4, 3, 4, 6, 9, 5, 6, 8, 12, 44, 4, 8, 14, 29, 78, 84, 5, 14, 20, 63, 255, 203, 130, 5, 20, 30, 100, 742, 1114, 484, 343, 6, 30, 48, 215, 1382, 3463, 4549, 1757, 685, 10, 48, 70, 468, 5647, 9963, 19065, 28184, 4979, 1704, 11, 70, 108, 785, 14755, 71695, 77212]