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!)
A023484 a(n) = b(n) + d(n), where b(n) = (n-th Lucas number) and d(n) = (n-th non-Fibonacci number). 1
5, 9, 11, 16, 21, 29, 41, 61, 91, 139, 216, 340, 540, 863, 1386, 2230, 3595, 5803, 9375, 15154, 24504, 39632, 64109, 103713, 167793, 271476, 439239, 710683, 1149888, 1860536, 3010388, 4870887, 7881237, 12752085, 20633282, 33385326 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Harvey P. Dale, Table of n, a(n) for n = 0..1000

FORMULA

a(n) = A000032(n+1) + A001690(n+1). - R. J. Mathar, Feb 01 2019

MATHEMATICA

Module[{nn=40, nf}, nf=Take[Complement[Range[2nn], Fibonacci[Range[nn]]], nn]; Total/@Thread[{LucasL[Range[nn]], nf}]] (* Harvey P. Dale, Apr 26 2020 *)

CROSSREFS

Cf. A000032, A001690.

Sequence in context: A314599 A292089 A314600 * A102173 A171763 A342092

Adjacent sequences:  A023481 A023482 A023483 * A023485 A023486 A023487

KEYWORD

nonn

AUTHOR

Clark Kimberling

EXTENSIONS

a(14) onward corrected by Sean A. Irvine, Jun 04 2019

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 June 26 22:46 EDT 2022. Contains 354885 sequences. (Running on oeis4.)