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.

A268774 T(n,k)=Number of nXk 0..2 arrays with some element plus some horizontally, vertically, diagonally or antidiagonally adjacent neighbor totalling two exactly once.

Table of values

n a(n)
1 0
2 3
3 3
4 12
5 12
6 12
7 36
8 32
9 32
10 36
11 96
12 100
13 112
14 100
15 96
16 240
17 248
18 446
19 446
20 248
21 240
22 576
23 620
24 1524
25 2296
26 1524
27 620
28 576
29 1344
30 1456
31 5214
32 10340
33 10340
34 5214
35 1456
36 1344
37 3072
38 3380
39 17000
40 46312
41 64112
42 46312
43 17000
44 3380
45 3072
46 6912
47 7656
48 54822

List of values

[0, 3, 3, 12, 12, 12, 36, 32, 32, 36, 96, 100, 112, 100, 96, 240, 248, 446, 446, 248, 240, 576, 620, 1524, 2296, 1524, 620, 576, 1344, 1456, 5214, 10340, 10340, 5214, 1456, 1344, 3072, 3380, 17000, 46312, 64112, 46312, 17000, 3380, 3072, 6912, 7656, 54822]