A089146 Greatest common divisor of n^2 - 4 and n^2 + 4.

4, 1, 8, 1, 4, 1, 8, 1, 4, 1, 8, 1, 4, 1, 8, 1, 4, 1, 8, 1, 4, 1, 8, 1, 4, 1, 8, 1, 4, 1, 8, 1, 4, 1, 8, 1, 4, 1, 8, 1, 4, 1, 8, 1, 4, 1, 8, 1, 4, 1, 8, 1, 4, 1, 8, 1, 4, 1, 8, 1, 4, 1, 8, 1, 4, 1, 8, 1, 4, 1, 8, 1, 4, 1, 8, 1, 4, 1, 8, 1, 4, 1, 8, 1, 4, 1, 8, 1, 4, 1, 8, 1, 4, 1, 8, 1, 4, 1, 8, 1, 4

Offset

0,1

Comments

Also decimal expansion of 4181/9999 = 0.418141814181...

Repeat [4,1,8,1], because for odd n, the GCD is 1; for n = 4k+2, GCD(16(k^2+k), 16(k^2+k)+8) = 8; for n = 4k, (16k^2-4,16k^2+4) can be divided by 4, but then GCD(4k^2-1,4k^2+1) = 1. - Georg Fischer, Jul 21 2022

Links

Table of n, a(n) for n=0..100.

Formula

Multiplicative with a(2) = 8, a(2^e) = 4 if e >= 2, a(p^e) = 1 otherwise. - David W. Wilson, Jun 12 2005

Dirichlet g.f.: zeta(s)*(1+7/2^s-4^(1-s)). - Amiram Eldar, Dec 31 2022

Sum_{k=1..n} a(k) ~ 7*n/2. - Vaclav Kotesovec, Dec 31 2022

Mathematica

a[n_] := GCD[n^2 - 4, n^2 + 4]; Array[a, 101, 0] (* Amiram Eldar, Dec 31 2022 *)

Prog

(PARI) g(n) = for(x=0, n, print1(gcd(x^2-4, x^2+4)", "))

Crossrefs

Cf. A028347, A087475.

Sequence in context: A084884 A329998 A143320 * A297402 A239666 A101512

Adjacent sequences: A089143 A089144 A089145 * A089147 A089148 A089149

Keyword

easy,nonn,mult

Author

Cino Hilliard, Dec 05 2003

Status

approved