A058301 - cp's OEIS frontend

A058301 Number of solutions to c(0)F(0) + ... + c(n)F(n) = 0, where c(i) = +-1 for i >= 0, number of (+1)'s >= number of (-1)'s, F(i) = A000045(i) = Fibonacci numbers.

n	a(n)
0	1
1	0
2	2
3	3
4	0
5	6
6	4
7	0
8	8
9	11
10	0
11	22
12	16
13	0
14	32
15	42
16	0
17	84
18	64
19	0
20	128
21	165
22	0
23	330
24	256
25	0
26	512
27	654
28	0
29	1308
30	1024
31	0
32	2048
33	2605
34	0
35	5210
36	4096
37	0
38	8192
39	10398
40	0
41	20796
42	16384
43	0
44	32768
45	41550
46	0
47	83100
48	65536
49	0
50	131072
51	166116
52	0
53	332232
54	262144
55	0

[1, 0, 2, 3, 0, 6, 4, 0, 8, 11, 0, 22, 16, 0, 32, 42, 0, 84, 64, 0, 128, 165, 0, 330, 256, 0, 512, 654, 0, 1308, 1024, 0, 2048, 2605, 0, 5210, 4096, 0, 8192, 10398, 0, 20796, 16384, 0, 32768, 41550, 0, 83100, 65536, 0, 131072, 166116, 0, 332232, 262144, 0]

cp's OEIS Frontend

A058301 Number of solutions to c(0)F(0) + ... + c(n)F(n) = 0, where c(i) = +-1 for i >= 0, number of (+1)'s >= number of (-1)'s, F(i) = A000045(i) = Fibonacci numbers.

Table of values

List of values