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.

A188966 T(n,k)=Number of nXk array permutations with each element moved and moved by a city block distance of no more than three.

Table of values

n a(n)
1 0
2 1
3 1
4 2
5 9
6 2
7 9
8 265
9 265
10 9
11 24
12 8132
13 78976
14 8132
15 24
16 57
17 154564
18 22666641
19 22666641
20 154564
21 57
22 140
23 2790864
24 4064659324
25 62394485617
26 4064659324
27 2790864
28 140
29 376
30 55327556
31 741295637637
32 109564294856817
33 109564294856817

List of values

[0, 1, 1, 2, 9, 2, 9, 265, 265, 9, 24, 8132, 78976, 8132, 24, 57, 154564, 22666641, 22666641, 154564, 57, 140, 2790864, 4064659324, 62394485617, 4064659324, 2790864, 140, 376, 55327556, 741295637637, 109564294856817, 109564294856817]

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

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