id:A089146 - OEIS Search Results

Search: id:A089146

Displaying 1-1 of 1 results found.

page 1

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

+0
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, 1, 8, 1, 4 (list; graph; listen)

	OFFSET	`0,1`
	COMMENT	`Also decimal expansion of 4181/9999 = .418141814181..` `Multiplicative with a(2) = 8, a(2^e) = 4 if e >= 2, a(p^e) = 1 otherwise. David W. Wilson (davidwwilson(AT)comcast.net) Jun 12, 2005.`
	PROGRAM	`(PARI) g(n) = for(x=0, n, print1(gcd(x^2-4, x^2+4)", "))`
	CROSSREFS	`Sequence in context: A139045 A084884 A143320 this_sequence A101512 A085994 A040019` `Adjacent sequences: A089143 A089144 A089145 this_sequence A089147 A089148 A089149`
	KEYWORD	`easy,nonn,mult`
	AUTHOR	`Cino Hilliard (hillcino368(AT)gmail.com), Dec 05 2003`

page 1

Search completed in 0.003 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research