The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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). 0
 2, 4, 6, 10, 14, 21, 30, 44, 67, 102, 158, 248, 393, 627, 1006, 1617, 2605, 4203, 6788, 10970, 17736, 28683, 46395, 75053, 121423, 196449, 317843, 514262, 832074, 1346304, 2178345, 3524615, 5702925, 9227504, 14930392, 24157858 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS MATHEMATICA Module[{nn=50, nlu, fib=Fibonacci[Range[2, nn+1]], len}, nlu=Join[{1, 2, 3}, Complement[ Range[4, nn], LucasL[Range[nn]]]]; len=Min[nn, Length[nlu]]; Total/@Thread[{Take[fib, len], Take[nlu, len]}]] (* Harvey P. Dale, Mar 14 2013 *) CROSSREFS Sequence in context: A136460 A000065 A237758 * A103445 A001747 A048670 Adjacent sequences:  A023496 A023497 A023498 * A023500 A023501 A023502 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 26 02:10 EDT 2021. Contains 346294 sequences. (Running on oeis4.)