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.

A131104 Rectangular array read by antidiagonals: a(n, k) is the number of ways to put k labeled objects into n labeled boxes so that there is one box with exactly one object (n, k >= 1).

Table of values

n a(n)
1 1
2 2
3 0
4 3
5 0
6 0
7 4
8 0
9 6
10 0
11 5
12 0
13 18
14 8
15 0
16 6
17 0
18 36
19 24
20 10
21 0
22 7
23 0
24 60
25 48
26 120
27 12
28 0
29 8
30 0
31 90
32 80
33 420
34 396
35 14
36 0
37 9
38 0
39 126
40 120
41 1000
42 1512
43 1092
44 16
45 0
46 10
47 0
48 168
49 168
50 1950
51 3720
52 6804
53 2736
54 18
55 0
56 11
57 0
58 216
59 224
60 3360
61 7380
62 23240
63 31008
64 6480
65 20
66 0
67 12
68 0

List of values

[1, 2, 0, 3, 0, 0, 4, 0, 6, 0, 5, 0, 18, 8, 0, 6, 0, 36, 24, 10, 0, 7, 0, 60, 48, 120, 12, 0, 8, 0, 90, 80, 420, 396, 14, 0, 9, 0, 126, 120, 1000, 1512, 1092, 16, 0, 10, 0, 168, 168, 1950, 3720, 6804, 2736, 18, 0, 11, 0, 216, 224, 3360, 7380, 23240, 31008, 6480, 20, 0, 12, 0]