id:A118119 - OEIS Search Results

Search: id:A118119

Displaying 1-1 of 1 results found.

page 1

Smallest integer i for which gcd(i^n+1, (i+1)^n+1)>1.

+0
1

2, 5, 8, 6, 2, 4, 5, 2, 2, 10, 8, 6, 2, 3, 6, 14, 2, 37, 6, 2, 2, 10, 2, 6, 2, 2, 6, 10, 2, 52, 22, 2, 2, 4, 8, 26, 2, 3, 5 (list; graph; listen)

	OFFSET	`2,1`
	EXAMPLE	`a(3)=5 because gcd(2=1^3+1,9=2^3+1)=gcd(9,28)=gcd(28,65)=gcd(65,126)=1 and` `gcd(126=5^3+1,217=6^3+1)=7>1`
	CROSSREFS	`Sequence in context: A020859 A062089 A011201 this_sequence A057929 A140053 A103311` `Adjacent sequences: A118116 A118117 A118118 this_sequence A118120 A118121 A118122`
	KEYWORD	`nonn`
	AUTHOR	`Adam Kertesz (adamkertesz(AT)att.net), May 12 2006; May 13 2006`

page 1

Search completed in 0.002 seconds

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.