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.

A331518 a(n) = Sum_{k=0..n} q(n,k) * !k, where q(n,k) = number of partitions of n into k distinct parts and !k = subfactorial of k.

Table of values

n a(n)
0 1
1 0
2 0
3 1
4 1
5 2
6 4
7 5
8 7
9 10
10 21
11 24
12 37
13 49
14 71
15 129
16 160
17 227
18 313
19 433
20 572
21 1012
22 1213
23 1750
24 2315
25 3223
26 4159
27 5740
28 8945
29 11206
30 15402
31 20506
32 27545
33 36068
34 48122
35 61960
36 94694
37 116240
38 158580
39 205397
40 276458
41 352526
42 470101
43 596433
44 781224
45 1111228

List of values

[1, 0, 0, 1, 1, 2, 4, 5, 7, 10, 21, 24, 37, 49, 71, 129, 160, 227, 313, 433, 572, 1012, 1213, 1750, 2315, 3223, 4159, 5740, 8945, 11206, 15402, 20506, 27545, 36068, 48122, 61960, 94694, 116240, 158580, 205397, 276458, 352526, 470101, 596433, 781224, 1111228]