A196628 - OEIS

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

A196628

Smallest positive m such that gcd(2^m-3,3^m-2) has a prime divisor A196627(n).

3, 3783, 712999, 49917253, 136990592551, 7248859698551, 59868530942221, 4656948575329

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

Terms corresponding to large terms of A196627: 98094352361503, 1857852631158188383144, 61512962997290050622501, 52562720950794975283168567, 4014260345679275427187521366, 534798197159783071320442036049, 5184100446504760872368997541979245, 58816866228485537800474853024132386, 1849888032222116576474743304081139265, 90975863449090968810811203864826789811575855795214739996300735537197. (may not be in order)

LINKS

Table of n, a(n) for n=1..8.

A. S. Izotov, On prime divisors of GCD(3^n-2,2^n-3), Fibonacci Quarterly 43, May 2005, pp. 130-131.

CROSSREFS

Cf. A109768

Sequence in context: A003831 A200735 A226984 * A089895 A116213 A136544

Adjacent sequences: A196625 A196626 A196627 * A196629 A196630 A196631

KEYWORD

nonn,hard,more

AUTHOR

Max Alekseyev, Oct 04 2011

STATUS

approved