A271356 Difference sequence of the sequence A271354 of the increasing sequence of products of two distinct Fibonacci numbers greater than 1.

4, 5, 1, 8, 2, 13, 1, 2, 21, 2, 3, 34, 2, 1, 5, 55, 3, 2, 8, 89, 5, 1, 2, 13, 144, 8, 2, 3, 21, 233, 13, 2, 1, 5, 34, 377, 21, 3, 2, 8, 55, 610, 34, 5, 1, 2, 13, 89, 987, 55, 8, 2, 3, 21, 144, 1597, 89, 13, 2, 1, 5, 34, 233, 2584, 144, 21, 3, 2, 8, 55, 377

Offset

1,1

Comments

Conjecture: every term except the first is a Fibonacci number.

Links

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

Mathematica

z = 100; f[n_] := Fibonacci[n];
t = Take[Sort[Flatten[Table[f[m] f[n], {n, 3, z}, {m, 3, n - 1}]]], 1000];
Differences[t]

Crossrefs

Cf. A271354, A000045, A049998.

Sequence in context: A237109 A199384 A178233 * A201411 A353313 A206282

Adjacent sequences: A271353 A271354 A271355 * A271357 A271358 A271359

Keyword

nonn,easy,look

Author

Clark Kimberling, May 02 2016

Status

approved