# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a191885 Showing 1-1 of 1 %I A191885 #10 Oct 31 2017 12:39:09 %S A191885 0,1,3,4,5,6,8,9,11,13,14,15,19,21,23,24,30,34,36,37,38,39,49,55,59, %T A191885 60,61,63,79,89,95,97,99,101,102,103,128,144,154,157,160,164,165,166, %U A191885 168,207,233,249,254,259,265,267,269,271,273,335,377,403,411,419 %N A191885 Ordered sequence of nonnegative differences 5*f-g, where f and g are positive Fibonacci numbers (A000045). %H A191885 G. C. Greubel, Table of n, a(n) for n = 1..5000 %t A191885 c = 2; d = 5; f[n_] := Fibonacci[n]; %t A191885 g[n_] := c*f[n]; h[n_] := d*f[n]; %t A191885 t[i_, j_] := h[i] + g[j]; %t A191885 u = Table[t[i, j], {i, 1, 20}, {j, 1, 20}]; %t A191885 v = Union[Flatten[u ]] (* A191883 *) %t A191885 t1[i_, j_] := If[g[i] - h[j] > 0, g[i] - h[j], 0] %t A191885 u1 = Table[t1[i, j], {i, 1, 20}, {j, 1, 20}]; %t A191885 v1 = Union[Flatten[u1 ]] (* A191884: c*f(i)-d*f(j) *) %t A191885 g1[n_] := d*f[n]; h1[n_] := c*f[n]; %t A191885 t2[i_, j_] := If[g1[i] - h1[j] > 0, g1[i] - h1[j], 0] %t A191885 u2 = Table[t2[i, j], {i, 1, 20}, {j, 1, 20}]; %t A191885 v2 = Union[Flatten[u2 ]] (* A191885: d*f(i)-c*f(j) *) %t A191885 v3 = Union[v1, v2] (* A191886 *) %Y A191885 Cf. A191883, A191884, A191886. %K A191885 nonn %O A191885 1,3 %A A191885 _Clark Kimberling_, Jun 18 2011 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE