A272911 Difference sequence of the sequence the increasing sequence of products of two Lucas numbers A000032.

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, 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, 170, 521, 105, 15, 3, 2, 5, 40, 275, 843, 170, 25, 4, 1, 10, 65

Offset: 1

Author

Clark Kimberling, May 10 2016

Keywords

• nonn
• easy

Comments

Conjecture: every term is a product of two Lucas numbers or a product of two Fibonacci numbers.

Links

• Clark Kimberling, Table of n, a(n) for n = 1..1000

Crossrefs

Cf. A000032, A000045, A272909, A272912.

Programs

Mathematica

z = 100; t = Take[Sort[Flatten[Table[LucasL[m] LucasL[n], {n, 1, z}, {m, n, z}]]],   1000]; Differences[t]