a(n) = n*F(n) - (n-1)*F(n-1), where the F(j)'s are the Fibonacci numbers (F(0)=0, F(1)=1).

Terms

a(0) =1a(1) =1a(2) =4a(3) =6a(4) =13a(5) =23a(6) =43a(7) =77a(8) =138a(9) =244a(10) =429a(11) =749a(12) =1301a(13) =2249a(14) =3872a(15) =6642a(16) =11357a(17) =19363a(18) =32927a(19) =55861a(20) =94566a(21) =159776a(22) =269469a(23) =453721a(24) =762793a(25) =1280593a(26) =2147068a(27) =3595422a(28) =6013933a(29) =10048559