|
| |
|
|
A118119
|
|
Smallest integer i for which gcd(i^n+1, (i+1)^n+1)>1.
|
|
3
| |
|
|
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, 5, 2, 24, 6, 2, 2, 32, 6, 4, 2, 2, 8, 5, 2, 6, 5, 4, 2, 230, 2, 44, 2, 2, 17, 4, 2, 55, 5, 2, 2, 34, 2
(list; graph; refs; listen; history; internal format)
|
|
|
|
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
|
|
|
MAPLE
| A118119 := proc(n) local k , g; for k from 1 do g := igcd(k^n+1, (k+1)^n+1) ; if g>1 then return k ; end if; end do: end proc: # R. J. Mathar, Mar 07 2011
|
|
|
CROSSREFS
| Sequence in context: A011201 A201772 A196605 * A057929 A154127 A138371
Adjacent sequences: A118116 A118117 A118118 * A118120 A118121 A118122
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Adam Kertesz (adamkertesz(AT)att.net), May 12 2006; May 13 2006
|
| |
|
|
