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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A200526 a(n) = gcd(t(n), t(3n-1)), where t = A200217. 0

%I #25 Aug 02 2019 04:10:41

%S 2156316023,211148507797805,392841376460687116573,

%T 13886731309220741899538675431,1359801885649216204023955447726829,

%U 2529908688645864568558938918274367865293,89430911052730984787593270943984417274689212615

%N a(n) = gcd(t(n), t(3n-1)), where t = A200217.

%C Successive maxima of the GCD in A200217 occur between A200217(n) and A200217(3n-1) terms. Conjecture: All terms have same set of prime divisors, that can be used to complete prime factorization of every term in this sequence by the GCD method. All prime divisors with exception 19 are of the form 4k+1. The integer 19 divides a(3n+1) for n=0,1,2,3,...

%t ff = {}; Do[AppendTo[ff, GCD[15/8 Fibonacci[15 (-1 + 2 n)] - 9/20 Fibonacci[30 (-1 + 2 n)] + 1/40 Fibonacci[45 (-1 + 2 n)], 15/8 Fibonacci[15 (-1 + 2 (3 n - 1))] - 9/20 Fibonacci[30 (-1 + 2 (3 n - 1))] + 1/40 Fibonacci[45 (-1 + 2 (3 n - 1))]]], {n, 2, 10}]; ff

%Y Cf. A200217.

%K nonn

%O 2,1

%A _Artur Jasinski_, Nov 18 2011

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.

Last modified September 7 11:06 EDT 2024. Contains 375730 sequences. (Running on oeis4.)