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!)
A023496 a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2) and d(n) = (n-th number that is 1 or is not a Lucas number). 0
4, 7, 13, 19, 29, 43, 65, 101, 157, 247, 392, 626, 1004, 1616, 2604, 4202, 6787, 10969, 17735, 28682, 46394, 75052, 121421, 196448, 317842, 514261, 832073, 1346303, 2178344, 3524614, 5702924, 9227503, 14930391, 24157857, 39088210 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
FORMULA
a(n) = A000045(n+4)+A090946(n+1), n>0. - R. J. Mathar, Feb 01 2019
MATHEMATICA
Module[{nn=50, fibs, nlucs, len}, fibs=Fibonacci[Range[4, nn+4]]; nlucs=Join[ {1}, Complement[Range[nn], LucasL[Range[nn/5]]]]; len=Min[Length[fibs], Length[nlucs]]; Total/@Thread[{Take[fibs, len], Take[nlucs, len]}]] (* Harvey P. Dale, Aug 09 2013 *)
CROSSREFS
Sequence in context: A238327 A243811 A194073 * A191868 A176003 A216880
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 May 1 17:11 EDT 2024. Contains 372175 sequences. (Running on oeis4.)