A260845 - cp's OEIS frontend

A260845 a(n) = Sum_{k=0..n} (-1)^kP(n,k)k!, where P(n,k) is the number of partitions of n into k parts.

n	a(n)
0	1
1	-1
2	1
3	-5
4	21
5	-105
6	635
7	-4507
8	36457
9	-330971
10	3334377
11	-36913947
12	445426739
13	-5818545721
14	81805507069
15	-1231690773053
16	19772941871385
17	-337146625794753
18	6085005877228943
19	-115897323408009187
20	2323090928155541677
21	-48883768421712917555
22	1077440388662366900397

[1, -1, 1, -5, 21, -105, 635, -4507, 36457, -330971, 3334377, -36913947, 445426739, -5818545721, 81805507069, -1231690773053, 19772941871385, -337146625794753, 6085005877228943, -115897323408009187, 2323090928155541677, -48883768421712917555, 1077440388662366900397]

cp's OEIS Frontend

A260845 a(n) = Sum_{k=0..n} (-1)^kP(n,k)k!, where P(n,k) is the number of partitions of n into k parts.

Table of values

List of values

cp's OEIS Frontend

A260845 a(n) = Sum_{k=0..n} (-1)^k*P(n,k)*k!, where P(n,k) is the number of partitions of n into k parts.

Table of values

List of values

A260845 a(n) = Sum_{k=0..n} (-1)^kP(n,k)k!, where P(n,k) is the number of partitions of n into k parts.