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,...}.
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,...}.
Terms
- a(0) =6a(1) =10a(2) =19a(3) =16a(4) =24a(5) =42a(6) =71a(7) =68a(8) =106a(9) =150a(10) =178a(11) =447a(12) =288a(13) =431a(14) =3026a(15) =754a(16) =1119a(17) =1220a(18) =1902a(19) =2974a(20) =3194a(21) =19979a(22) =5168a(23) =142026a(24) =7728a(25) =13098a(26) =13530a(27) =136187a(28) =20276a(29) =62158
External references
- oeis: A287273