# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a090946 Showing 1-1 of 1 %I A090946 #31 Sep 10 2024 11:04:02 %S A090946 0,2,5,6,8,9,10,12,13,14,15,16,17,19,20,21,22,23,24,25,26,27,28,30,31, %T A090946 32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,48,49,50,51,52,53,54,55, %U A090946 56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,77,78,79 %N A090946 Non-Lucas numbers: complement of A000204. %H A090946 G. C. Greubel, Table of n, a(n) for n = 1..10000 %F A090946 a(n) = A057854(n-2), n>2. - _R. J. Mathar_, Jan 29 2019 %p A090946 L[1]:=1: L[2]:=3: for n from 3 to 10 do L[n]:=L[n-1]+L[n-2] od: A:={seq(L[n],n=1..10)}: B:={seq(n,n=0..L[10])}: C:=B minus A; # _Emeric Deutsch_, Dec 14 2004 %t A090946 Complement[Range[0,100],LucasL[Range[10]]] (* _Harvey P. Dale_, Mar 21 2012 *) %o A090946 (Python) %o A090946 def A090946(n): %o A090946 if n == 1: return 0 %o A090946 def f(x): %o A090946 if x<=2: return n %o A090946 a, b, c = 1, 3, 0 %o A090946 while b<=x: %o A090946 a, b = b, a+b %o A090946 c += 1 %o A090946 return n+c %o A090946 m, k = n, f(n) %o A090946 while m != k: m, k = k, f(k) %o A090946 return m # _Chai Wah Wu_, Sep 10 2024 %Y A090946 Cf. A000032, A000204, A022801. %K A090946 nonn,easy %O A090946 1,2 %A A090946 _N. J. A. Sloane_, Feb 28 2004 %E A090946 More terms from _Emeric Deutsch_, Dec 14 2004 %E A090946 Offset corrected by _Michel Marcus_, Aug 15 2017 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE