Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 May 17 2016 09:24:02
%S 1,1,1,1,1,1,1,1,1,1,1,1,2,1,2,3,3,1,1,2,1,4,1,5,1,2,2,3,2,5,1,8,1,1,
%T 3,4,4,1,10,2,13,2,1,5,6,5,2,3,15,3,21,3,1,1,8,10,10,1,4,25,5,34,5,1,
%U 2,13,16,15,3,2,5,40,8,55,8,1,1,3,21,26,25
%N Difference sequence of A272916.
%C Conjecture: every term belongs to A272916.
%H Clark Kimberling, <a href="/A272917/b272917.txt">Table of n, a(n) for n = 1..1000</a>
%t z = 400; u2 = Sort[Flatten[Table[Fibonacci[i + 1]*Fibonacci[j + 1], {i, 1, z}, {j, i, z}]]];
%t v2 = Sort[Flatten[Table[LucasL[i]*LucasL[j], {i, 1, z}, {j, i, z}]]];
%t u = Take[Union[u2, v2], 200] (* A272916 *)
%t d = Take[Differences[u], 200] (* A272917 *)
%Y Cf. A272916.
%K nonn,easy
%O 1,13
%A _Clark Kimberling_, May 10 2016