Les Marvin sequence: a(n) = F(n) + (n-1)*F(n-1), F() = Fibonacci numbers.

Terms

a(0) =1a(1) =2a(2) =4a(3) =9a(4) =17a(5) =33a(6) =61a(7) =112a(8) =202a(9) =361a(10) =639a(11) =1123a(12) =1961a(13) =3406a(14) =5888a(15) =10137a(16) =17389a(17) =29733a(18) =50693a(19) =86204a(20) =146246a(21) =247577a(22) =418299a(23) =705479a(24) =1187857a(25) =1997018a(26) =3352636a(27) =5621097a(28) =9412937a(29) =15744681