A385590 - cp's OEIS frontend

A385590 Triangle read by rows, based on Fibonacci numbers: Let i > 1 be such that F(i) <= n < F(i+1); i.e., i = A130233(n). Then T(n, k) = F(i-1)^2 + 1 - (i-1) mod 2 + (n - F(i)) * F(i-2) + (k-1) * F(i-1) where F(k) = A000045(k).

n	a(n)
1	1
2	2
3	3
4	4
5	6
6	8
7	5
8	7
9	9
10	11
11	10
12	13
13	16
14	19
15	22
16	12
17	15
18	18
19	21
20	24
21	27
22	14
23	17
24	20
25	23
26	26
27	29
28	32
29	25
30	30
31	35
32	40
33	45
34	50
35	55
36	60
37	28
38	33
39	38
40	43
41	48
42	53
43	58
44	63
45	68
46	31
47	36
48	41
49	46
50	51
51	56
52	61
53	66
54	71
55	76
56	34
57	39
58	44
59	49
60	54
61	59
62	64
63	69
64	74
65	79
66	84
67	37
68	42
69	47
70	52
71	57
72	62
73	67
74	72
75	77
76	82
77	87
78	92
79	65
80	73
81	81
82	89
83	97

[1, 2, 3, 4, 6, 8, 5, 7, 9, 11, 10, 13, 16, 19, 22, 12, 15, 18, 21, 24, 27, 14, 17, 20, 23, 26, 29, 32, 25, 30, 35, 40, 45, 50, 55, 60, 28, 33, 38, 43, 48, 53, 58, 63, 68, 31, 36, 41, 46, 51, 56, 61, 66, 71, 76, 34, 39, 44, 49, 54, 59, 64, 69, 74, 79, 84, 37, 42, 47, 52, 57, 62, 67, 72, 77, 82, 87, 92, 65, 73, 81, 89, 97]

cp's OEIS Frontend

A385590 Triangle read by rows, based on Fibonacci numbers: Let i > 1 be such that F(i) <= n < F(i+1); i.e., i = A130233(n). Then T(n, k) = F(i-1)^2 + 1 - (i-1) mod 2 + (n - F(i)) * F(i-2) + (k-1) * F(i-1) where F(k) = A000045(k).

Table of values

List of values

n	a(n)
1	1
2	2
3	3
4	4
5	6
6	8
7	5
8	7
9	9
10	11
11	10
12	13
13	16
14	19
15	22
16	12
17	15
18	18
19	21
20	24
21	27
22	14
23	17
24	20
25	23
26	26
27	29
28	32
29	25
30	30
31	35
32	40
33	45
34	50
35	55
36	60
37	28
38	33
39	38
40	43
41	48
42	53
43	58
44	63
45	68
46	31
47	36
48	41
49	46
50	51
51	56
52	61
53	66
54	71
55	76
56	34
57	39
58	44
59	49
60	54
61	59
62	64
63	69
64	74
65	79
66	84
67	37
68	42
69	47
70	52
71	57
72	62
73	67
74	72
75	77
76	82
77	87
78	92
79	65
80	73
81	81
82	89
83	97

n	a(n)
1	1
2	2
3	3
4	4
5	6
6	8
7	5
8	7
9	9
10	11
11	10
12	13
13	16
14	19
15	22
16	12
17	15
18	18
19	21
20	24
21	27
22	14
23	17
24	20
25	23
26	26
27	29
28	32
29	25
30	30
31	35
32	40
33	45
34	50
35	55
36	60
37	28
38	33
39	38
40	43
41	48
42	53
43	58
44	63
45	68
46	31
47	36
48	41
49	46
50	51
51	56
52	61
53	66
54	71
55	76
56	34
57	39
58	44
59	49
60	54
61	59
62	64
63	69
64	74
65	79
66	84
67	37
68	42
69	47
70	52
71	57
72	62
73	67
74	72
75	77
76	82
77	87
78	92
79	65
80	73
81	81
82	89
83	97

n	a(n)
1	1
2	2
3	3
4	4
5	6
6	8
7	5
8	7
9	9
10	11
11	10
12	13
13	16
14	19
15	22
16	12
17	15
18	18
19	21
20	24
21	27
22	14
23	17
24	20
25	23
26	26
27	29
28	32
29	25
30	30
31	35
32	40
33	45
34	50
35	55
36	60
37	28
38	33
39	38
40	43
41	48
42	53
43	58
44	63
45	68
46	31
47	36
48	41
49	46
50	51
51	56
52	61
53	66
54	71
55	76
56	34
57	39
58	44
59	49
60	54
61	59
62	64
63	69
64	74
65	79
66	84
67	37
68	42
69	47
70	52
71	57
72	62
73	67
74	72
75	77
76	82
77	87
78	92
79	65
80	73
81	81
82	89
83	97