|
|
A010034
|
|
Numbers k such that gcd(k^17 + 9, (k+1)^17 + 9) > 1.
|
|
2
|
|
|
8424432925592889329288197322308900672459420460792433, 17361015163508605989239159575667846308252873717727992, 26297597401424322649190121829026791944046326974663551, 35234179639340039309141084082385737579839780231599110
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
In other words, let f(n) = gcd(n^17 + 9, (n+1)^17 + 9). Then f(n) = 1 for all n <= 8424432925592889329288197322308900672459420460792432, but f(8424432925592889329288197322308900672459420460792433) > 1.
In fact f(8424432925592889329288197322308900672459420460792433) = 8936582237915716659950962253358945635793453256935559.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = 8424432925592889329288197322308900672459420460792433 + 8936582237915716659950962253358945635793453256935559*(n-1). - Max Alekseyev, Jul 26 2009
|
|
MATHEMATICA
|
Table[8424432925592889329288197322308900672459420460792433+ 8936582237915716659950962253358945635793453256935559(n-1), {n, 5}] (* or *) LinearRecurrence[{2, -1}, {8424432925592889329288197322308900672459420460792433, 17361015163508605989239159575667846308252873717727992}, 5] (* Harvey P. Dale, Jun 12 2014 *)
|
|
PROG
|
(PARI) A010034(n)=8936582237915716659950962253358945635793453256935559*n-512149312322827330662764931050044963334032796143126 \\ M. F. Hasler, Mar 17 2015
(PARI) \\ The values (a(1), p) can also be found using:
{p=polresultant(x^17+9, (x+1)^17+9); s=vector(2, i, Mod(-9, p)^(1/17)); (u=s[2]/s[1])!=1&&until(setsearch(Set(s=concat(s, s[#s]*u)), s[#s]+1), )}
\\ Then the last element s[#s] equals Mod(a(1), p). - M. F. Hasler, Mar 26 2015
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|