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.

A189435 T(n,k)=Number of nXk array permutations with each element not moving, or moving one space N, SW or SE.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 1
7 1
8 3
9 5
10 1
11 1
12 5
13 9
14 9
15 1
16 1
17 8
18 29
19 31
20 20
21 1
22 1
23 13
24 65
25 140
26 109
27 41
28 1
29 1
30 21
31 181
32 571
33 841
34 367
35 85
36 1
37 1
38 34
39 441
40 2413
41 5680
42 4653
43 1245
44 178
45 1
46 1
47 55
48 1165
49 10069
50 40065
51 52241
52 26589
53 4247
54 369
55 1
56 1
57 89
58 2929
59 42205
60 278105
61 606201
62 493941

List of values

[1, 1, 1, 1, 2, 1, 1, 3, 5, 1, 1, 5, 9, 9, 1, 1, 8, 29, 31, 20, 1, 1, 13, 65, 140, 109, 41, 1, 1, 21, 181, 571, 841, 367, 85, 1, 1, 34, 441, 2413, 5680, 4653, 1245, 178, 1, 1, 55, 1165, 10069, 40065, 52241, 26589, 4247, 369, 1, 1, 89, 2929, 42205, 278105, 606201, 493941]