OFFSET
1,1
LINKS
Harvey P. Dale, Table of n, a(n) for n = 1..10000
MAPLE
lucas := proc(n::integer) if n = 0 then RETURN(2) ; elif n = 1 then RETURN(1) ; else RETURN(combinat[fibonacci](n-1)+combinat[fibonacci](n+1)) ; fi ; end : islucas := proc(i::integer) local lucn, n ; for n from 0 to i do lucn := lucas(n) ; if lucn = i then RETURN(1) ; elif lucn > i then RETURN(0) ; fi ; od : end : isfibo := proc(i::integer) local fibn, n ; for n from 0 to i+1 do fibn := combinat[fibonacci](n) ; if fibn = i then RETURN(1) ; elif fibn > i then RETURN(0) ; fi ; od : end : for n from 0 to 100 do if islucas(n) = 0 and isfibo(n) = 0 then printf("%d, ", n) ; fi ; od : # R. J. Mathar, Apr 23 2006
MATHEMATICA
a := {1, 3}; For[n = 3, n <= 100, n++, a=Append[a, a[[n-1]]+a[[n-2]]]]; Complement[Range[150], a, Table[Fibonacci[n], {n, 1, 100}]] (* Stefan Steinerberger, Apr 17 2006 *)
Module[{nn=12, fib, luc}, fib=Fibonacci[Range[nn]]; luc=LucasL[Range[nn]]; Complement[ Range[fib[[-1]]], luc, fib]] (* Harvey P. Dale, Mar 10 2019 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Ido Romano (idoromano(AT)gmail.com), Apr 20 2005
EXTENSIONS
More terms from Stefan Steinerberger and Atilla Bora (borabanana(AT)gmail.com), Apr 17 2006
STATUS
approved