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.

A218663 T(n,k) = Hilltop maps: number of n X k binary arrays indicating the locations of corresponding elements not exceeded by any king-move neighbor in a random 0..1 n X k array.

Table of values

n a(n)
1 1
2 3
3 3
4 5
5 15
6 5
7 9
8 57
9 57
10 9
11 17
12 225
13 417
14 225
15 17
16 31
17 891
18 3249
19 3249
20 891
21 31
22 57
23 3519
24 25533
25 50625
26 25533
27 3519
28 57
29 105
30 13905
31 199489
32 793881
33 793881
34 199489
35 13905
36 105
37 193
38 54945
39 1560161
40 12383361
41 24879489
42 12383361
43 1560161
44 54945

List of values

[1, 3, 3, 5, 15, 5, 9, 57, 57, 9, 17, 225, 417, 225, 17, 31, 891, 3249, 3249, 891, 31, 57, 3519, 25533, 50625, 25533, 3519, 57, 105, 13905, 199489, 793881, 793881, 199489, 13905, 105, 193, 54945, 1560161, 12383361, 24879489, 12383361, 1560161, 54945]