A024466 - cp's OEIS frontend

A024466 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (Fibonacci numbers), t = A023533.

n	a(n)
1	1
2	0
3	0
4	1
5	1
6	2
7	3
8	0
9	0
10	1
11	1
12	2
13	3
14	5
15	8
16	13
17	21
18	34
19	55
20	1
21	1
22	2
23	3
24	5
25	8
26	13
27	21
28	34
29	55
30	89
31	144
32	233
33	377
34	610
35	988
36	1598
37	2586
38	4184
39	6770
40	8
41	13
42	21
43	34
44	55
45	89
46	144
47	233
48	377
49	610
50	987
51	1597
52	2584
53	4181
54	6765
55	10946
56	17712
57	28658
58	46370
59	75028
60	121398
61	196426

[1, 0, 0, 1, 1, 2, 3, 0, 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 988, 1598, 2586, 4184, 6770, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17712, 28658, 46370, 75028, 121398, 196426]

cp's OEIS Frontend

A024466 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (Fibonacci numbers), t = A023533.

Table of values

List of values

cp's OEIS Frontend

A024466 a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (Fibonacci numbers), t = A023533.

Table of values

List of values

A024466 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (Fibonacci numbers), t = A023533.