A316706 - cp's OEIS frontend

A316706 Number of solutions to k_1 + 2k_2 + ... + nk_n = n, where k_i are from {-1,0,1}, i=1..n.

n	a(n)
0	1
1	1
2	1
3	2
4	5
5	12
6	27
7	69
8	178
9	457
10	1194
11	3178
12	8538
13	23062
14	62726
15	171804
16	473069
17	1308397
18	3634075
19	10133154
20	28352421
21	79575702
22	223981549
23	632101856
24	1788172541
25	5069879063
26	14403962756
27	41001479103
28	116921037003
29	333971884899
30	955443681814
31	2737387314548
32	7853533625522
33	22560919253095
34	64890249175438
35	186854616134794

[1, 1, 1, 2, 5, 12, 27, 69, 178, 457, 1194, 3178, 8538, 23062, 62726, 171804, 473069, 1308397, 3634075, 10133154, 28352421, 79575702, 223981549, 632101856, 1788172541, 5069879063, 14403962756, 41001479103, 116921037003, 333971884899, 955443681814, 2737387314548, 7853533625522, 22560919253095, 64890249175438, 186854616134794]

cp's OEIS Frontend

A316706 Number of solutions to k_1 + 2k_2 + ... + nk_n = n, where k_i are from {-1,0,1}, i=1..n.

Table of values

List of values

cp's OEIS Frontend

A316706 Number of solutions to k_1 + 2*k_2 + ... + n*k_n = n, where k_i are from {-1,0,1}, i=1..n.

Table of values

List of values

A316706 Number of solutions to k_1 + 2k_2 + ... + nk_n = n, where k_i are from {-1,0,1}, i=1..n.