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.

A265870 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element plus any antidiagonal neighbor equal to n-1.

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 2
6 6
7 1
8 4
9 42
10 24
11 1
12 6
13 340
14 984
15 120
16 1
17 12
18 3136
19 56496
20 48216
21 720
22 1
23 20
24 30456
25 3965392
26 28645840
27 2869200
28 5040
29 1
30 40
31 307464
32 307543008
33 21193260208
34 20091622560
35 278125200
36 40320
37 1
38 70
39 3182784
40 25346247472
41 17674408924672

List of values

[1, 1, 2, 1, 2, 6, 1, 4, 42, 24, 1, 6, 340, 984, 120, 1, 12, 3136, 56496, 48216, 720, 1, 20, 30456, 3965392, 28645840, 2869200, 5040, 1, 40, 307464, 307543008, 21193260208, 20091622560, 278125200, 40320, 1, 70, 3182784, 25346247472, 17674408924672]

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

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