a(n) = a(n-1) + a(n-2) + F(n), with a(0) = 0, a(1) = 1, a(2) = a(1) + a(0), a(3) = a(2) + a(1), a(4) = a(3) + a(2) + 2.

A166106

a(n) = a(n-1) + a(n-2) + F(n), with a(0) = 0, a(1) = 1, a(2) = a(1) + a(0), a(3) = a(2) + a(1), a(4) = a(3) + a(2) + 2.

Terms

    a(0) =0a(1) =1a(2) =1a(3) =2a(4) =5a(5) =12a(6) =25a(7) =50a(8) =96a(9) =180a(10) =331a(11) =600a(12) =1075a(13) =1908a(14) =3360a(15) =5878a(16) =10225a(17) =17700a(18) =30509a(19) =52390a(20) =89664a(21) =153000a(22) =260375a(23) =442032a(24) =748775a(25) =1265832a(26) =2136000a(27) =3598250a(28) =6052061a(29) =10164540

External references