[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
0,1
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
KEYWORD
nonn
STATUS
approved