login
This site is supported by donations to The OEIS Foundation.

 

Logo

Many excellent designs for a new banner were submitted. We will use the best of them in rotation.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A023485 a(n) = b(n) + d(n), where b(n) = (n-th Lucas number A000204 > 1) and d(n) = (n-th nonFibonacci number). 0

%I

%S 7,10,14,20,28,40,59,90,138,215,339,539,862,1384,2229,3594,5802,9374,

%T 15153,24503,39631,64108,103712,167792,271475,439237,710682,1149887,

%U 1860535,3010387,4870886,7881236,12752084,20633281,33385325,54018565,87403848,141422370

%N a(n) = b(n) + d(n), where b(n) = (n-th Lucas number A000204 > 1) and d(n) = (n-th nonFibonacci number).

%C In other words, a(n) = A001690(n) + A000204(n+1), n >= 1. - _N. J. A. Sloane_, Mar 16 2013

%t nn=40;Module[{lcs=LucasL[Range[2,nn+1]],nf,len},nf=Complement[ Range[ nn+ 10],Fibonacci[Range[nn]]];len=Min[Length[lcs],Length[nf]];Total/@ Thread[ {Take[lcs,len],Take[nf,len]}]] (* _Harvey P. Dale_, Mar 16 2013 *)

%Y Cf. A001690, A000204.

%K nonn

%O 1,1

%A _Clark Kimberling_

%E Corrected and extended by _Harvey P. Dale_, Mar 16 2013

%E Offset corrected, cross-references added by _N. J. A. Sloane_, Mar 16 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified April 18 03:01 EDT 2014. Contains 240688 sequences.