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.

A188981 T(n,k)=Number of nXk array permutations with each element moved but moved no more than a city block distance of two.

Table of values

n a(n)
1 0
2 1
3 1
4 2
5 9
6 2
7 4
8 116
9 116
10 4
11 6
12 900
13 7264
14 900
15 6
16 13
17 7836
18 295264
19 295264
20 7836
21 13
22 24
23 71865
24 12838276
25 54113236
26 12838276
27 71865
28 24
29 45
30 640513
31 577290185
32 10523263424
33 10523263424
34 577290185
35 640513
36 45
37 84
38 5706113
39 25631148992

List of values

[0, 1, 1, 2, 9, 2, 4, 116, 116, 4, 6, 900, 7264, 900, 6, 13, 7836, 295264, 295264, 7836, 13, 24, 71865, 12838276, 54113236, 12838276, 71865, 24, 45, 640513, 577290185, 10523263424, 10523263424, 577290185, 640513, 45, 84, 5706113, 25631148992]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.