136187

Appears in sequences

• 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,...}.at n=27A287273
• Solution of the complementary equation a(n) = 2*a(n-1) - a(n-3) + b(n-2), where a(0) = 1, a(1) = 2, a(2) = 3, b(0) = 4, b(1) = 5, b(2) = 6, and (a(n)) and (b(n)) are increasing complementary sequences.at n=20A295616