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
5, 8, 10, 14, 18, 24, 33, 48, 70, 105, 161, 251, 396, 630, 1009, 1620, 2608, 4206, 6791, 10973, 17739, 28686, 46398, 75056, 121425, 196451, 317846, 514265, 832077, 1346307, 2178348, 3524618, 5702928, 9227507 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
MATHEMATICA
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 *)
CROSSREFS
Sequence in context: A262707 A257046 A314382 * A314383 A229859 A329237
KEYWORD
nonn
AUTHOR
STATUS
approved

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 18:17 EDT 2024. Contains 371962 sequences. (Running on oeis4.)