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 A272911 #8 May 17 2016 09:22:24
%S A272911 2,1,3,2,2,1,4,2,3,7,1,4,11,3,2,5,18,4,1,10,29,5,2,3,15,47,10,1,4,25,
%T A272911 76,15,3,2,5,40,123,25,4,1,10,65,199,40,5,2,3,15,105,322,65,10,1,4,25,
%U A272911 170,521,105,15,3,2,5,40,275,843,170,25,4,1,10,65
%N A272911 Difference sequence of the sequence the increasing sequence of products of two Lucas numbers A000032.
%C A272911 Conjecture: every term is a product of two Lucas numbers or a product of two Fibonacci numbers.
%H A272911 Clark Kimberling, <a href="/A272911/b272911.txt">Table of n, a(n) for n = 1..1000</a>
%t A272911 z = 100; t = Take[Sort[Flatten[Table[LucasL[m] LucasL[n], {n, 1, z}, {m, n, z}]]], 1000]; Differences[t]
%Y A272911 Cf. A000032, A000045, A272909, A272912.
%K A272911 nonn,easy
%O A272911 1,1
%A A272911 _Clark Kimberling_, May 10 2016