ROSECODE 110
Histheorically?
Let's define a fast-growing sequence.
Fn= 22n+1, n>=1
Now let's calculate the sum s of all pairwise gcd(namely sum of greatest common divisors of all 2 element combinations). Now the sequence starts with n=1 and goes up to n=x. Give the answer as a polynomial in x. Output format is (a,b,c) where ax2+bx+c is the polynomial. Use reals with one digit after the decimal point.
Fn= 22n+1, n>=1
Now let's calculate the sum s of all pairwise gcd(namely sum of greatest common divisors of all 2 element combinations). Now the sequence starts with n=1 and goes up to n=x. Give the answer as a polynomial in x. Output format is (a,b,c) where ax2+bx+c is the polynomial. Use reals with one digit after the decimal point.