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!)
A022809 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
4, 7, 12, 19, 28, 43, 65, 100, 156, 247, 392, 626, 1004, 1615, 2603, 4201, 6787, 10969, 17735, 28682, 46394, 75052, 121421, 196447, 317841, 514260, 832072, 1346302, 2178344, 3524614, 5702924, 9227503 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
MATHEMATICA
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 *)
CROSSREFS
Sequence in context: A097536 A293829 A344421 * A297554 A188554 A020732
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 16 10:35 EDT 2024. Contains 371709 sequences. (Running on oeis4.)