login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A066788
a(n) = gcd(phi(n), n^2 + 1).
1
1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 5, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 10, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 5, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 10, 1, 2, 1, 2, 5, 2, 1, 2, 1, 2, 5, 2, 1, 2, 1, 10, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2
OFFSET
1,3
LINKS
MATHEMATICA
Table[GCD[EulerPhi[n], n^2+1], {n, 110}] (* Harvey P. Dale, Feb 14 2018 *)
PROG
(PARI) a(n) = { gcd( eulerphi(n), n^2 + 1) } \\ Harry J. Smith, Mar 26 2010
CROSSREFS
Sequence in context: A347516 A322357 A160989 * A160988 A184319 A160987
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Jan 18 2002
STATUS
approved