A118654 - cp's OEIS frontend

A118654 Square array T(n,k) read by antidiagonals: T(n,k) = 2^n*Fibonacci(k) - Fibonacci(k-2).

n	a(n)
0	1
1	1
2	0
3	1
4	1
5	1
6	1
7	3
8	2
9	1
10	1
11	7
12	4
13	3
14	2
15	1
16	15
17	8
18	7
19	5
20	3
21	1
22	31
23	16
24	15
25	11
26	8
27	5
28	1
29	63
30	32
31	31
32	23
33	18
34	13
35	8
36	1
37	127
38	64
39	63
40	47
41	38
42	29
43	21
44	13
45	1
46	255
47	128
48	127
49	95
50	78
51	61
52	47
53	34
54	21
55	1
56	511
57	256
58	255
59	191
60	158
61	125
62	99
63	76
64	55
65	34

[1, 1, 0, 1, 1, 1, 1, 3, 2, 1, 1, 7, 4, 3, 2, 1, 15, 8, 7, 5, 3, 1, 31, 16, 15, 11, 8, 5, 1, 63, 32, 31, 23, 18, 13, 8, 1, 127, 64, 63, 47, 38, 29, 21, 13, 1, 255, 128, 127, 95, 78, 61, 47, 34, 21, 1, 511, 256, 255, 191, 158, 125, 99, 76, 55, 34]

cp's OEIS Frontend

A118654 Square array T(n,k) read by antidiagonals: T(n,k) = 2^n*Fibonacci(k) - Fibonacci(k-2).

Table of values

List of values

n	a(n)
0	1
1	1
2	0
3	1
4	1
5	1
6	1
7	3
8	2
9	1
10	1
11	7
12	4
13	3
14	2
15	1
16	15
17	8
18	7
19	5
20	3
21	1
22	31
23	16
24	15
25	11
26	8
27	5
28	1
29	63
30	32
31	31
32	23
33	18
34	13
35	8
36	1
37	127
38	64
39	63
40	47
41	38
42	29
43	21
44	13
45	1
46	255
47	128
48	127
49	95
50	78
51	61
52	47
53	34
54	21
55	1
56	511
57	256
58	255
59	191
60	158
61	125
62	99
63	76
64	55
65	34

n	a(n)
0	1
1	1
2	0
3	1
4	1
5	1
6	1
7	3
8	2
9	1
10	1
11	7
12	4
13	3
14	2
15	1
16	15
17	8
18	7
19	5
20	3
21	1
22	31
23	16
24	15
25	11
26	8
27	5
28	1
29	63
30	32
31	31
32	23
33	18
34	13
35	8
36	1
37	127
38	64
39	63
40	47
41	38
42	29
43	21
44	13
45	1
46	255
47	128
48	127
49	95
50	78
51	61
52	47
53	34
54	21
55	1
56	511
57	256
58	255
59	191
60	158
61	125
62	99
63	76
64	55
65	34

n	a(n)
0	1
1	1
2	0
3	1
4	1
5	1
6	1
7	3
8	2
9	1
10	1
11	7
12	4
13	3
14	2
15	1
16	15
17	8
18	7
19	5
20	3
21	1
22	31
23	16
24	15
25	11
26	8
27	5
28	1
29	63
30	32
31	31
32	23
33	18
34	13
35	8
36	1
37	127
38	64
39	63
40	47
41	38
42	29
43	21
44	13
45	1
46	255
47	128
48	127
49	95
50	78
51	61
52	47
53	34
54	21
55	1
56	511
57	256
58	255
59	191
60	158
61	125
62	99
63	76
64	55
65	34