A339050 - cp's OEIS frontend

A339050 Triangle read by rows T(n, m) = F(2m-1)(n-m) + F(2*m), for 1 <= m <= n, where F = A000045 (Fibonacci).

n	a(n)
1	1
2	2
3	3
4	3
5	5
6	8
7	4
8	7
9	13
10	21
11	5
12	9
13	18
14	34
15	55
16	6
17	11
18	23
19	47
20	89
21	144
22	7
23	13
24	28
25	60
26	123
27	233
28	377
29	8
30	15
31	33
32	73
33	157
34	322
35	610
36	987
37	9
38	17
39	38
40	86
41	191
42	411
43	843
44	1597
45	2584
46	10
47	19
48	43
49	99
50	225
51	500
52	1076
53	2207
54	4181
55	6765

[1, 2, 3, 3, 5, 8, 4, 7, 13, 21, 5, 9, 18, 34, 55, 6, 11, 23, 47, 89, 144, 7, 13, 28, 60, 123, 233, 377, 8, 15, 33, 73, 157, 322, 610, 987, 9, 17, 38, 86, 191, 411, 843, 1597, 2584, 10, 19, 43, 99, 225, 500, 1076, 2207, 4181, 6765]

cp's OEIS Frontend

A339050 Triangle read by rows T(n, m) = F(2m-1)(n-m) + F(2*m), for 1 <= m <= n, where F = A000045 (Fibonacci).

Table of values

List of values

cp's OEIS Frontend

A339050 Triangle read by rows T(n, m) = F(2*m-1)*(n-m) + F(2*m), for 1 <= m <= n, where F = A000045 (Fibonacci).

Table of values

List of values

A339050 Triangle read by rows T(n, m) = F(2m-1)(n-m) + F(2*m), for 1 <= m <= n, where F = A000045 (Fibonacci).