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.

A222842 T(n,k) is the number of n X k 0..3 arrays with no more than floor(n*k/2) elements equal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..3 order.

Table of values

n a(n)
1 1
2 1
3 1
4 2
5 8
6 2
7 11
8 105
9 105
10 11
11 34
12 1585
13 4797
14 1585
15 34
16 131
17 23107
18 326408
19 326408
20 23107
21 131
22 438
23 353631
24 15364848
25 70144361
26 15364848
27 353631
28 438
29 2150
30 5338646
31 1077545438
32 15371324917
33 15371324917
34 1077545438
35 5338646
36 2150
37 7676

List of values

[1, 1, 1, 2, 8, 2, 11, 105, 105, 11, 34, 1585, 4797, 1585, 34, 131, 23107, 326408, 326408, 23107, 131, 438, 353631, 15364848, 70144361, 15364848, 353631, 438, 2150, 5338646, 1077545438, 15371324917, 15371324917, 1077545438, 5338646, 2150, 7676]