id:A089129 - OEIS Search Results

Search: id:A089129

Displaying 1-1 of 1 results found.

page 1

Greatest common divisor of n^k-7 and n^k+7.

+0
1

7, 2, 1, 2, 1, 2, 1, 14, 1, 2, 1, 2, 1, 2, 7, 2, 1, 2, 1, 2, 1, 14, 1, 2, 1, 2, 1, 2, 7, 2, 1, 2, 1, 2, 1, 14, 1, 2, 1, 2, 1, 2, 7, 2, 1, 2, 1, 2, 1, 14, 1, 2, 1, 2, 1, 2, 7, 2, 1, 2, 1, 2, 1, 14, 1, 2, 1, 2, 1, 2, 7, 2, 1, 2, 1, 2, 1, 14, 1, 2, 1, 2, 1, 2, 7, 2, 1, 2, 1, 2, 1, 14, 1, 2, 1, 2, 1, 2, 7, 2, 1 (list; graph; listen)

	OFFSET	`0,1`
	PROGRAM	`(PARI) g(n, k) = for(x=0, n, print1(gcd(x^k-7, x^k+7)", "))`
	CROSSREFS	`Sequence in context: A001204 A021585 A103713 this_sequence A100957 A133362 A010140` `Adjacent sequences: A089126 A089127 A089128 this_sequence A089130 A089131 A089132`
	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