A141688 - cp's OEIS frontend

A141688 Triangle T(n, k) = Fibonacci(2k)T(n-1, k) + Fibonacci(2(n-k+1))T(n-1, k-1), with T(n, 1) = T(n, n) = 1, read by rows.

n	a(n)
1	1
2	1
3	1
4	1
5	6
6	1
7	1
8	26
9	26
10	1
11	1
12	99
13	416
14	99
15	1
16	1
17	352
18	5407
19	5407
20	352
21	1
22	1
23	1200
24	62616
25	227094
26	62616
27	1200
28	1
29	1
30	3977
31	673728
32	8212854
33	8212854
34	673728
35	3977
36	1
37	1
38	12918
39	6889153
40	269486766
41	903413940
42	269486766
43	6889153
44	12918
45	1
46	1
47	41338
48	67863290
49	8256432767
50	88493861004
51	88493861004
52	8256432767
53	67863290
54	41338
55	1

[1, 1, 1, 1, 6, 1, 1, 26, 26, 1, 1, 99, 416, 99, 1, 1, 352, 5407, 5407, 352, 1, 1, 1200, 62616, 227094, 62616, 1200, 1, 1, 3977, 673728, 8212854, 8212854, 673728, 3977, 1, 1, 12918, 6889153, 269486766, 903413940, 269486766, 6889153, 12918, 1, 1, 41338, 67863290, 8256432767, 88493861004, 88493861004, 8256432767, 67863290, 41338, 1]

cp's OEIS Frontend

A141688 Triangle T(n, k) = Fibonacci(2k)T(n-1, k) + Fibonacci(2(n-k+1))T(n-1, k-1), with T(n, 1) = T(n, n) = 1, read by rows.

Table of values

List of values

cp's OEIS Frontend

A141688 Triangle T(n, k) = Fibonacci(2*k)*T(n-1, k) + Fibonacci(2*(n-k+1))*T(n-1, k-1), with T(n, 1) = T(n, n) = 1, read by rows.

Table of values

List of values

A141688 Triangle T(n, k) = Fibonacci(2k)T(n-1, k) + Fibonacci(2(n-k+1))T(n-1, k-1), with T(n, 1) = T(n, n) = 1, read by rows.