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.

A240192 T(n,k)=Number of nXk 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or three 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 5
6 3
7 1
8 8
9 12
10 4
11 1
12 14
13 37
14 27
15 7
16 1
17 26
18 129
19 138
20 73
21 10
22 1
23 50
24 478
25 771
26 680
27 154
28 15
29 1
30 98
31 1908
32 5240
33 7170
34 2413
35 358
36 24
37 1
38 194
39 7868
40 40765
41 91879
42 44594
43 10017
44 872
45 35
46 1
47 386
48 32888
49 336257
50 1399773
51 1005029
52 333607
53 43956
54 1871
55 54
56 1

List of values

[1, 1, 2, 1, 5, 3, 1, 8, 12, 4, 1, 14, 37, 27, 7, 1, 26, 129, 138, 73, 10, 1, 50, 478, 771, 680, 154, 15, 1, 98, 1908, 5240, 7170, 2413, 358, 24, 1, 194, 7868, 40765, 91879, 44594, 10017, 872, 35, 1, 386, 32888, 336257, 1399773, 1005029, 333607, 43956, 1871, 54, 1]