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.

A251149 T(n,k) = Number of (n+1) X (k+1) 0..2 arrays with every 2 X 2 subblock summing to 4 and no 2 X 2 subblock having exactly two nonzero entries.

Table of values

n a(n)
1 13
2 27
3 27
4 53
5 49
6 53
7 107
8 87
9 87
10 107
11 213
12 161
13 143
14 161
15 213
16 427
17 299
18 247
19 247
20 299
21 427
22 853
23 565
24 433
25 401
26 433
27 565
28 853
29 1707
30 1075
31 777
32 667
33 667
34 777
35 1075
36 1707
37 3413
38 2065
39 1413
40 1141
41 1061
42 1141
43 1413
44 2065
45 3413
46 6827
47 3991
48 2607
49 1987
50 1743

List of values

[13, 27, 27, 53, 49, 53, 107, 87, 87, 107, 213, 161, 143, 161, 213, 427, 299, 247, 247, 299, 427, 853, 565, 433, 401, 433, 565, 853, 1707, 1075, 777, 667, 667, 777, 1075, 1707, 3413, 2065, 1413, 1141, 1061, 1141, 1413, 2065, 3413, 6827, 3991, 2607, 1987, 1743]