login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022799 a(n) = F(n+1) + c(n) where F(k) is k-th Fibonacci number and c(n) is n-th non-Fibonacci number. 0

%I #5 Aug 23 2020 15:00:01

%S 5,8,10,14,18,24,33,48,70,105,161,251,396,630,1009,1620,2608,4206,

%T 6791,10973,17739,28686,46398,75056,121425,196451,317846,514265,

%U 832077,1346307,2178348,3524618,5702928,9227507

%N a(n) = F(n+1) + c(n) where F(k) is k-th Fibonacci number and c(n) is n-th non-Fibonacci number.

%t Module[{nn=35,f,c,len},f=Rest[Fibonacci[Range[nn]]];c=Complement[ Range[ Fibonacci[ nn]],f];len=Min[Length[f],Length[c]];Total/@Thread[ {Take[ f,len],Take[c,len]}]] (* _Harvey P. Dale_, Aug 23 2020 *)

%K nonn

%O 1,1

%A _Clark Kimberling_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 13:30 EDT 2024. Contains 371957 sequences. (Running on oeis4.)