This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A272916 #13 May 17 2016 09:23:49
%S A272916 1,2,3,4,5,6,7,8,9,10,11,12,13,15,16,18,21,24,25,26,28,29,33,34,39,40,
%T A272916 42,44,47,49,54,55,63,64,65,68,72,76,77,87,89,102,104,105,110,116,121,
%U A272916 123,126,141,144,165,168,169,170,178,188,198,199,203,228,233
%N A272916 Numbers that are a product of two Fibonacci (A000045) numbers or a product of two Lucas (A000032) numbers.
%C A272916 Conjecture: if c and d are consecutive terms, then d - c is a term.
%H A272916 Clark Kimberling, <a href="/A272916/b272916.txt">Table of n, a(n) for n = 1..1000</a>
%e A272916 Equals union(A049997, A272909), in increasing order.
%t A272916 z = 400; u2 = Sort[Flatten[Table[Fibonacci[i + 1] * Fibonacci[j + 1], {i, 1, z}, {j, i, z}]]];
%t A272916 v2 = Sort[Flatten[Table[LucasL[i]*LucasL[j], {i, 1, z}, {j, i, z}]]];
%t A272916 u = Take[Union[u2, v2], 200] (* A272916 *)
%t A272916 d = Take[Differences[u], 200] (* A272917 *)
%Y A272916 Cf. A000032, A000045, A049997, A272909, A272917 (difference sequence).
%K A272916 nonn,easy
%O A272916 1,2
%A A272916 _Clark Kimberling_, May 10 2016