A287273 - cp's OEIS frontend

A287273 Consider all ways of writing the composite Fibonacci number A090206(n+3) as product of two divisors d1d2 = d3d4 = ... The sequence a(n) gives the minimum sums of {d1+d2, d3+d4,...}.

n	a(n)
1	6
2	10
3	19
4	16
5	24
6	42
7	71
8	68
9	106
10	150
11	178
12	447
13	288
14	431
15	3026
16	754
17	1119
18	1220
19	1902
20	2974
21	3194
22	19979
23	5168
24	142026
25	7728
26	13098
27	13530
28	136187
29	20276
30	62158
31	34130
32	52994
33	119811
34	92736
35	138673
36	6169970
37	241310
38	6379215
39	392836
40	55946694
41	587943
42	768686

[6, 10, 19, 16, 24, 42, 71, 68, 106, 150, 178, 447, 288, 431, 3026, 754, 1119, 1220, 1902, 2974, 3194, 19979, 5168, 142026, 7728, 13098, 13530, 136187, 20276, 62158, 34130, 52994, 119811, 92736, 138673, 6169970, 241310, 6379215, 392836, 55946694, 587943, 768686]

cp's OEIS Frontend

A287273 Consider all ways of writing the composite Fibonacci number A090206(n+3) as product of two divisors d1d2 = d3d4 = ... The sequence a(n) gives the minimum sums of {d1+d2, d3+d4,...}.

Table of values

List of values

cp's OEIS Frontend

A287273 Consider all ways of writing the composite Fibonacci number A090206(n+3) as product of two divisors d1*d2 = d3*d4 = ... The sequence a(n) gives the minimum sums of {d1+d2, d3+d4,...}.

Table of values

List of values

A287273 Consider all ways of writing the composite Fibonacci number A090206(n+3) as product of two divisors d1d2 = d3d4 = ... The sequence a(n) gives the minimum sums of {d1+d2, d3+d4,...}.