|
|
A066787
|
|
a(n) = 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;
text;
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
|
|
|
MAPLE
|
|
|
MATHEMATICA
|
|
|
PROG
|
(PARI) { for (n=1, 1000, write("b066787.txt", n, " ", gcd( 2^n + 1, n^2 + 1)) ) } \\ Harry J. Smith, Mar 25 2010
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|