A272917 Difference sequence of A272916.

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, 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, 2, 13, 16, 15, 3, 2, 5, 40, 8, 55, 8, 1, 1, 3, 21, 26, 25

Offset

1,13

Comments

Conjecture: every term belongs to A272916.

Links

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

Mathematica

z = 400; u2 = Sort[Flatten[Table[Fibonacci[i + 1]*Fibonacci[j + 1], {i, 1, z}, {j, i, z}]]];
v2 = Sort[Flatten[Table[LucasL[i]*LucasL[j], {i, 1, z}, {j, i, z}]]];
u = Take[Union[u2, v2], 200]   (* A272916 *)
d = Take[Differences[u], 200]  (* A272917 *)

Crossrefs

Cf. A272916.

Sequence in context: A095056 A337557 A186333 * A239627 A101933 A117127

Adjacent sequences: A272914 A272915 A272916 * A272918 A272919 A272920

Keyword

nonn,easy

Author

Clark Kimberling, May 10 2016

Status

approved