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!)
A178766 Values of gcd(Fibonacci(n), Fibonacci(n+1)+1) sorted with no repeats. 2

%I #24 May 18 2019 02:04:00

%S 1,2,3,5,7,13,18,34,47,89,123,233,322,610,843,1597,2207,4181,5778,

%T 10946,15127,28657,39603,75025,103682,196418,271443,514229,710647,

%U 1346269,1860498,3524578,4870847,9227465,12752043,24157817,33385282,63245986,87403803

%N Values of gcd(Fibonacci(n), Fibonacci(n+1)+1) sorted with no repeats.

%H Alois P. Heinz, <a href="/A178766/b178766.txt">Table of n, a(n) for n = 1..1000</a>

%F G.f.: (x^5 + x^4 - 2*x^2 - x)/(-x^4 + 3*x^2 - 1). - _Alois P. Heinz_, Dec 28 2010

%p a:= n-> `if` (n<2, n, (Matrix (4, (i, j)-> if i+1=j then 1 elif i=4 then [-1, 0, 3, 0][j] else 0 fi)^(n-1). <<2, 2, 3, 5>>)[1, 1]): seq (a(n), n=1..40); # _Alois P. Heinz_, Dec 28 2010

%t Take[Union@Table[GCD[Fibonacci[n],Fibonacci[n+1]+1],{n,1000}],60]

%t GCD[#[[1]],#[[2]]+1]&/@Partition[Fibonacci[Range[100]],2,1]//Union (* _Harvey P. Dale_, Sep 22 2016 *)

%Y Mix terms of A001519 and A005248. Cf. A063726.

%K nonn

%O 1,2

%A _Vladimir Joseph Stephan Orlovsky_, Dec 26 2010

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 April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)