a(n) = b(n) + d(n), where b(n) = ( (n+1)st Fibonacci number) and d(n) = (n-th number that is 1, 2, or 3, or is not a Lucas number).

A023499

a(n) = b(n) + d(n), where b(n) = ( (n+1)st Fibonacci number) and d(n) = (n-th number that is 1, 2, or 3, or is not a Lucas number).

Terms

    a(0) =2a(1) =4a(2) =6a(3) =10a(4) =14a(5) =21a(6) =30a(7) =44a(8) =67a(9) =102a(10) =158a(11) =248a(12) =393a(13) =627a(14) =1006a(15) =1617a(16) =2605a(17) =4203a(18) =6788a(19) =10970a(20) =17736a(21) =28683a(22) =46395a(23) =75053a(24) =121423a(25) =196449a(26) =317843a(27) =514262a(28) =832074a(29) =1346304

External references