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.

A266131 T(n,k) = Number of n X k integer arrays with each element equal to the number of horizontal, diagonal and antidiagonal neighbors exactly one smaller than itself.

Table of values

n a(n)
1 1
2 3
3 1
4 4
5 9
6 1
7 5
8 25
9 20
10 1
11 9
12 49
13 77
14 61
15 1
16 16
17 149
18 117
19 385
20 189
21 1
22 25
23 625
24 278
25 572
26 2099
27 544
28 1
29 39
30 2141
31 1959
32 3851
33 4336
34 9083
35 1629
36 1
37 64
38 5433
39 11044
40 44623
41 62104
42 19750
43 48188
44 4973
45 1
46 105
47 17269
48 36730
49 347576
50 1285961
51 326145
52 102201
53 249446

List of values

[1, 3, 1, 4, 9, 1, 5, 25, 20, 1, 9, 49, 77, 61, 1, 16, 149, 117, 385, 189, 1, 25, 625, 278, 572, 2099, 544, 1, 39, 2141, 1959, 3851, 4336, 9083, 1629, 1, 64, 5433, 11044, 44623, 62104, 19750, 48188, 4973, 1, 105, 17269, 36730, 347576, 1285961, 326145, 102201, 249446]