|
| |
|
|
A066787
|
|
GCD( 2^n + 1, n^2 + 1).
|
|
1
| |
|
|
1, 5, 1, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 65, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 41, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 29, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 565, 1, 1, 1
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| a(n)=1 or a(n)=0 mod(5) or a(n) is a prime congruent to 1 mod(4).
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
|
PROG
| (PARI) { for (n=1, 1000, write("b066787.txt", n, " ", gcd( 2^n + 1, n^2 + 1)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Mar 25 2010]
|
|
|
CROSSREFS
| Sequence in context: A019429 A093826 A144699 * A058352 A121755 A104174
Adjacent sequences: A066784 A066785 A066786 * A066788 A066789 A066790
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 18 2002
|
| |
|
|
