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.

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

Table of values

n a(n)
1 1
2 3
3 1
4 4
5 5
6 1
7 5
8 13
9 16
10 1
11 9
12 36
13 64
14 39
15 1
16 16
17 100
18 161
19 230
20 105
21 1
22 25
23 233
24 736
25 929
26 1012
27 272
28 1
29 39
30 680
31 3846
32 6307
33 4893
34 3928
35 715
36 1
37 64
38 2201
39 16103
40 52171
41 53442
42 26948
43 16428
44 1869
45 1
46 105
47 6508
48 62778
49 371130
50 841668
51 457738
52 145274
53 65736

List of values

[1, 3, 1, 4, 5, 1, 5, 13, 16, 1, 9, 36, 64, 39, 1, 16, 100, 161, 230, 105, 1, 25, 233, 736, 929, 1012, 272, 1, 39, 680, 3846, 6307, 4893, 3928, 715, 1, 64, 2201, 16103, 52171, 53442, 26948, 16428, 1869, 1, 105, 6508, 62778, 371130, 841668, 457738, 145274, 65736]