%I #12 Oct 31 2017 06:56:11
%S 6,10,12,15,16,21,24,26,28,33,39,40,42,44,54,63,65,68,72,77,87,102,
%T 104,105,110,116,126,141,165,168,170,178,188,198,203,228,267,272,273,
%U 275,288,304,319,329,369,432,440,442,445,466,492,517,522,532,597,699
%N Numbers that are a product of two distinct Fibonacci numbers >1 or two distinct Lucas numbers > 1.
%C Let U = {F(i)F(j), 2 < i < j}, where F = A000045 (Fibonacci numbers), and V = {L(i)L(j), 1 < i < j}, where L = A000032 (Lucas numbers). The sets U and V are disjoint, and their union, arranged as a sequence in increasing order, is A274426.
%C Writing u for a Fibonacci product and v for a Lucas product, the numbers in A274426 are represented by the infinite word uuvuuvuuvvuuuvvuuuvvv... This is the concatenation of uuv and the words (u^k)(v^(k-1))(u^k)(v^k) for k >= 2. Thus, there are runs of Lucas products of every finite length and runs of Fibonacci products of every finite length except 1.
%C Guide to related sequences:
%C A274426 = union of (U = {F(i)F(j), 2 < i < j} and V = {L(i)L(j), 1 < i < j})
%C A274429 = union of (U = {F(i)F(j), 2 < i < j} and V = {L(i)L(j), 0 < i < j})
%C A274374 = union of (U = {F(i)F(j), 1 < i < j} and V = {L(i)L(j), 0 < i < j})
%H G. C. Greubel, <a href="/A274426/b274426.txt">Table of n, a(n) for n = 1..10000</a>
%e U = {6,10,15,16,...}, V = {12,21,28,...}, so that A274426 = (6,10,12,15,16,21,...).
%t z = 200; f[n_] := Fibonacci[n];
%t u = Take[Sort[Flatten[Table[f[m] f[n], {n, 3, z}, {m, 3, n - 1}]]], z]
%t g[n_] := LucasL[n];
%t v = Take[Sort[Flatten[Table[g[u] g[v], {u, 2, z}, {v, 2, u - 1}]]], z]
%t Intersection[u, v] (* empty *)
%t w = Union[u, v] (* A274426 *)
%t f1 = Select[Range[300], MemberQ[u, w[[#]]] &] (* A274427 *)
%t g1 = Select[Range[300], MemberQ[v, w[[#]]] &] (* A274428 *)
%Y Cf. A274427 (positions of numbers in U), A274428 (positions of numbers in V), A000032, A000045, A274429, A274432.
%K nonn,easy
%O 1,1
%A _Clark Kimberling_, Jun 22 2016