Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #15 Jun 05 2019 03:30:17
%S 8,13,18,27,39,58,88,137,214,338,538,861,1383,2227,3593,5801,9373,
%T 15152,24502,39630,64107,103711,167791,271474,439236,710680,1149886,
%U 1860534,3010386,4870885,7881235,12752083,20633280,33385324,54018564,87403847,141422369
%N a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th non-Fibonacci number).
%H Clark Kimberling, <a href="/A023487/b023487.txt">Table of n, a(n) for n = 0..1000</a>
%F a(n) = A000032(n+3) + A001690(n+1). - _R. J. Mathar_, Feb 01 2019
%t z = 10; f = Table[Fibonacci[n], {n, 2, z}]; c = Complement[Range[Max[f]], f];
%t t = Table[LucasL[n + 2], {n, 1, Length[c]}]; c + t
%Y Cf. A000032, A000045, A001690.
%K nonn
%O 0,1
%A _Clark Kimberling_
%E Edited by _Clark Kimberling_, Dec 02 2017