login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A271356 Difference sequence of the sequence A271354 of the increasing sequence of products of two distinct Fibonacci numbers greater than 1. 2

%I #9 May 13 2016 03:42:09

%S 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,

%T 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,

%U 144,1597,89,13,2,1,5,34,233,2584,144,21,3,2,8,55,377

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

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

%H Clark Kimberling, <a href="/A271356/b271356.txt">Table of n, a(n) for n = 1..1000</a>

%t z = 100; f[n_] := Fibonacci[n];

%t t = Take[Sort[Flatten[Table[f[m] f[n], {n, 3, z}, {m, 3, n - 1}]]], 1000];

%t Differences[t]

%Y Cf. A271354, A000045, A049998.

%K nonn,easy,look

%O 1,1

%A _Clark Kimberling_, May 02 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 14:38 EDT 2024. Contains 371254 sequences. (Running on oeis4.)