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.

A264071 T(n,k) = number of (n+1) X (k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 1,1 or 1,2.

Table of values

n a(n)
1 2
2 5
3 4
4 13
5 21
6 8
7 34
8 121
9 89
10 16
11 89
12 605
13 1210
14 377
15 32
16 233
17 3025
18 12100
19 12100
20 1597
21 64
22 610
23 15125
24 131890
25 239580
26 121000
27 6765
28 128
29 1597
30 75625
31 1445345
32 5645376
33 4745620
34 1210000
35 28657
36 256
37 4181
38 378125
39 15892745
40 130697424
41 242621698
42 94000060
43 12100000
44 121393
45 512

List of values

[2, 5, 4, 13, 21, 8, 34, 121, 89, 16, 89, 605, 1210, 377, 32, 233, 3025, 12100, 12100, 1597, 64, 610, 15125, 131890, 239580, 121000, 6765, 128, 1597, 75625, 1445345, 5645376, 4745620, 1210000, 28657, 256, 4181, 378125, 15892745, 130697424, 242621698, 94000060, 12100000, 121393, 512]