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!)
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

%I #5 Mar 14 2013 17:43:19

%S 2,4,6,10,14,21,30,44,67,102,158,248,393,627,1006,1617,2605,4203,6788,

%T 10970,17736,28683,46395,75053,121423,196449,317843,514262,832074,

%U 1346304,2178345,3524615,5702925,9227504,14930392,24157858

%N 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).

%t 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 *)

%K nonn

%O 0,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 May 7 21:53 EDT 2024. Contains 372317 sequences. (Running on oeis4.)