A079308 - cp's OEIS frontend

A079308 For a partition P of a positive integer, let f(P) be the product of k+1, over all parts k in P. Let a(n,r) be the sum of f(P) over all partitions P of n with smallest part r. Sequence gives table of a(n,r) for 1 <= r <= n, in the order a(1,1); a(2,1), a(2,2); a(3,1), a(3,2), a(3,3); ...

n	a(n)
1	2
2	4
3	3
4	14
5	0
6	4
7	36
8	9
9	0
10	5
11	100
12	12
13	0
14	0
15	6
16	236
17	42
18	16
19	0
20	0
21	7
22	602
23	54
24	20
25	0
26	0
27	0
28	8
29	1368
30	195
31	24
32	25
33	0
34	0
35	0
36	9
37	3242
38	246
39	92
40	30
41	0
42	0
43	0
44	0
45	10
46	7240
47	759
48	112
49	35
50	36
51	0
52	0
53	0
54	0
55	11
56	16386
57	1134
58	232
59	40
60	42
61	0
62	0
63	0
64	0
65	0
66	12
67	35692
68	2859
69	528
70	170
71	48
72	49
73	0
74	0
75	0
76	0
77	0
78	13

[2, 4, 3, 14, 0, 4, 36, 9, 0, 5, 100, 12, 0, 0, 6, 236, 42, 16, 0, 0, 7, 602, 54, 20, 0, 0, 0, 8, 1368, 195, 24, 25, 0, 0, 0, 9, 3242, 246, 92, 30, 0, 0, 0, 0, 10, 7240, 759, 112, 35, 36, 0, 0, 0, 0, 11, 16386, 1134, 232, 40, 42, 0, 0, 0, 0, 0, 12, 35692, 2859, 528, 170, 48, 49, 0, 0, 0, 0, 0, 13]

cp's OEIS Frontend

A079308 For a partition P of a positive integer, let f(P) be the product of k+1, over all parts k in P. Let a(n,r) be the sum of f(P) over all partitions P of n with smallest part r. Sequence gives table of a(n,r) for 1 <= r <= n, in the order a(1,1); a(2,1), a(2,2); a(3,1), a(3,2), a(3,3); ...

Table of values

List of values