login
a(n) = F(n+3) + c(n) where F(k) is k-th Fibonacci number and c(n) is n-th number that is 1 or 2 or is not a Fibonacci number.
1

%I #6 Nov 21 2013 12:46:20

%S 4,7,12,19,28,43,65,100,156,247,392,626,1004,1615,2603,4201,6787,

%T 10969,17735,28682,46394,75052,121421,196447,317841,514260,832072,

%U 1346302,2178344,3524614,5702924,9227503

%N a(n) = F(n+3) + c(n) where F(k) is k-th Fibonacci number and c(n) is n-th number that is 1 or 2 or is not a Fibonacci number.

%H Harvey P. Dale, <a href="/A022809/b022809.txt">Table of n, a(n) for n = 1..1000</a>

%t With[{nn=40},fibs=Fibonacci[Range[nn]];nonf=Take[Join[{1,2}, Complement[Range[nn+Length[fibs]],fibs]], Length[fibs]-3]; Total/@Thread[{Drop[fibs,3],nonf}]] (* _Harvey P. Dale_, Sep 30 2011 *)

%K nonn

%O 1,1

%A _Clark Kimberling_