a(n) = sigma_2(n)*Fibonacci(n), where sigma_2(n) = A001157(n), the sum of squares of divisors of n.

Terms

a(0) =1a(1) =5a(2) =20a(3) =63a(4) =130a(5) =400a(6) =650a(7) =1785a(8) =3094a(9) =7150a(10) =10858a(11) =30240a(12) =39610a(13) =94250a(14) =158600a(15) =336567a(16) =463130a(17) =1175720a(18) =1513522a(19) =3693690a(20) =5473000a(21) =10803710a(22) =15188210a(23) =39412800a(24) =48841275a(25) =103184050a(26) =161062760a(27) =333701550a(28) =432980818a(29) =1081652000