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.

A240406 T(n,k)=Number of nXk 0..3 arrays with no element equal to one plus the sum of elements to its left or three 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 1
2 2
3 2
4 3
5 5
6 3
7 4
8 14
9 14
10 4
11 7
12 24
13 77
14 24
15 7
16 10
17 77
18 235
19 235
20 77
21 10
22 15
23 182
24 1381
25 1304
26 1381
27 182
28 15
29 24
30 397
31 5566
32 13648
33 13648
34 5566
35 397
36 24
37 35
38 1164
39 21413
40 98837
41 257243
42 98837
43 21413
44 1164
45 35
46 54
47 2626
48 114951
49 692520
50 3366314
51 3366314
52 692520

List of values

[1, 2, 2, 3, 5, 3, 4, 14, 14, 4, 7, 24, 77, 24, 7, 10, 77, 235, 235, 77, 10, 15, 182, 1381, 1304, 1381, 182, 15, 24, 397, 5566, 13648, 13648, 5566, 397, 24, 35, 1164, 21413, 98837, 257243, 98837, 21413, 1164, 35, 54, 2626, 114951, 692520, 3366314, 3366314, 692520]