id:A089145 - OEIS Search Results

Search: id:A089145

Displaying 1-1 of 1 results found.

page 1

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

+0
1

3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1 (list; graph; listen)

	OFFSET	`0,1`
	PROGRAM	`(PARI) g(n) = for(x=0, n, print1(gcd(x^2-3, x^2+3)", "))`
	CROSSREFS	`Sequence in context: A108123 A105954 A002130 this_sequence A134199 A102189 A031252` `Adjacent sequences: A089142 A089143 A089144 this_sequence A089146 A089147 A089148`
	KEYWORD	`easy,nonn`
	AUTHOR	`Cino Hilliard (hillcino368(AT)gmail.com), Dec 05 2003`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research