|
| |
|
|
A066803
|
|
GCD( 3^n + 1, 2^n + 1).
|
|
1
| |
|
|
1, 5, 1, 1, 1, 5, 1, 1, 19, 25, 1, 1, 1, 145, 1, 1, 1, 5, 1, 1, 43, 5, 1, 97, 1, 265, 19, 1, 1, 25, 1, 1, 67, 5, 1, 1, 1, 5, 1, 1, 1, 145, 1, 1, 19, 5, 1, 1, 1, 12625, 307, 1, 1, 5, 1, 1, 1, 5, 1, 241, 1, 5, 817, 1, 1, 5, 1, 1, 139, 725, 1, 55969, 1, 745, 1, 1, 1, 265, 1, 1, 3097, 5, 499
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
|
PROG
| (PARI) { for (n=1, 1000, write("b066803.txt", n, " ", gcd(3^n + 1, 2^n + 1)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Mar 28 2010]
|
|
|
CROSSREFS
| Sequence in context: A051008 A109768 A069293 * A089608 A100615 A102280
Adjacent sequences: A066800 A066801 A066802 * A066804 A066805 A066806
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 18 2002
|
| |
|
|
