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.

A318144 T(n, k) = (-1)^k*k!*P(n, k), where P(n, k) is the number of partitions of n of length k. Triangle read by rows, 0 <= k <= n.

Table of values

n a(n)
0 1
1 0
2 -1
3 0
4 -1
5 2
6 0
7 -1
8 2
9 -6
10 0
11 -1
12 4
13 -6
14 24
15 0
16 -1
17 4
18 -12
19 24
20 -120
21 0
22 -1
23 6
24 -18
25 48
26 -120
27 720
28 0
29 -1
30 6
31 -24
32 72
33 -240
34 720
35 -5040
36 0
37 -1
38 8
39 -30
40 120
41 -360
42 1440
43 -5040
44 40320
45 0
46 -1
47 8
48 -42
49 144
50 -600
51 2160
52 -10080
53 40320
54 -362880

List of values

[1, 0, -1, 0, -1, 2, 0, -1, 2, -6, 0, -1, 4, -6, 24, 0, -1, 4, -12, 24, -120, 0, -1, 6, -18, 48, -120, 720, 0, -1, 6, -24, 72, -240, 720, -5040, 0, -1, 8, -30, 120, -360, 1440, -5040, 40320, 0, -1, 8, -42, 144, -600, 2160, -10080, 40320, -362880]