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.

A189150 T(n,k)=Number of nXk array permutations with each element making zero or one knight moves.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 4
9 4
10 1
11 1
12 16
13 49
14 16
15 1
16 1
17 36
18 569
19 569
20 36
21 1
22 1
23 81
24 4372
25 22865
26 4372
27 81
28 1
29 1
30 225
31 42689
32 602565
33 602565
34 42689
35 225
36 1
37 1
38 625
39 412189
40 20037184
41 46350185
42 20037184
43 412189
44 625
45 1
46 1
47 1600
48 3988132
49 697391125
50 5025299720

List of values

[1, 1, 1, 1, 1, 1, 1, 4, 4, 1, 1, 16, 49, 16, 1, 1, 36, 569, 569, 36, 1, 1, 81, 4372, 22865, 4372, 81, 1, 1, 225, 42689, 602565, 602565, 42689, 225, 1, 1, 625, 412189, 20037184, 46350185, 20037184, 412189, 625, 1, 1, 1600, 3988132, 697391125, 5025299720]