id:A089086 - OEIS Search Results

Search: id:A089086

Displaying 1-1 of 1 results found.

page 1

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

+0
1

5, 2, 1, 2, 1, 10, 1, 2, 1, 2, 5, 2, 1, 2, 1, 10, 1, 2, 1, 2, 5, 2, 1, 2, 1, 10, 1, 2, 1, 2, 5, 2, 1, 2, 1, 10, 1, 2, 1, 2, 5, 2, 1, 2, 1, 10, 1, 2, 1, 2, 5, 2, 1, 2, 1, 10, 1, 2, 1, 2, 5, 2, 1, 2, 1, 10, 1, 2, 1, 2, 5, 2, 1, 2, 1, 10, 1, 2, 1, 2, 5, 2, 1, 2, 1, 10, 1, 2, 1, 2, 5, 2, 1, 2, 1, 10, 1, 2, 1, 2, 5 (list; graph; listen)

	OFFSET	`0,1`
	PROGRAM	`(PARI) g(n) = for(x=0, n, print1(gcd(x^2-5, x^2+5)", "))`
	CROSSREFS	`Sequence in context: A029764 A136301 A132690 this_sequence A038631 A158625 A133615` `Adjacent sequences: A089083 A089084 A089085 this_sequence A089087 A089088 A089089`
	KEYWORD	`easy,nonn`
	AUTHOR	`Cino Hilliard (hillcino368(AT)gmail.com), Dec 05 2003`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research