a(n) = Sum_{1 <= i < j <= n} F(i)*F(j), where F(k) is the k-th Fibonacci number.

Terms

a(0) =0a(1) =1a(2) =5a(3) =17a(4) =52a(5) =148a(6) =408a(7) =1101a(8) =2937a(9) =7777a(10) =20504a(11) =53912a(12) =141520a(13) =371113a(14) =972573a(15) =2547825a(16) =6672876a(17) =17473996a(18) =45754280a(19) =119797205a(20) =313650865a(21) =821177281a(22) =2149916400a(23) =5628629232a(24) =14736064032a(25) =38579712913a(26) =101003317493a(27) =264430632401a(28) =692289215332