This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A302174 Smallest solution x of x^n + y^(n+1) = z^(n+2), x, y, z >= 1. 7
 1, 2, 27, 256, 472392, 262144, 13759414272, 4294967296, 4057816381784064 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS From M. F. Hasler, Apr 13 2018: (Start) Proofs for the upper limits given in the formula section: For odd n = 2k-1, x = 2^(2*k^2) yields a solution with x^(2k-1) = y^(2k) = 1/2*z^(2k+1), y = 2^(k(2k-1)) and z = 2^(2k(k-1)+1), because 2*k^2*(2k-1) + 1 = (2k+1)*(2k(k-1)+1). For even n = 2k, x = 2^(k*(2k+1))*3^(2k+2) yields a solution, with y = 2^(2*k^2)*3^(2k+1) and z = 2^(2*k^2-k+1)*3^(2k), because for the exponents of 3, (2k+1)^2 = (2k+2)2k + 1 and the factor 1+3 = 2^2 adds 2 to the (identical) exponent of 2 in x^(2k) and y^(2k+1), to factor as 2*k^2(2k+1) + 2 = (2k+2)(k(2k-1)+1). (End) LINKS FORMULA For odd n, a(n) <= 2^((n+1)^2/2); for even n, a(n) <= 2^(n*(n+1)/2)*3^(n+2). We may conjecture that, for n > 4, a(n) is given by these upper limits. EXAMPLE 1^0 + 3^1 = 2^2, therefore a(0) = 1. 2^1 + 5^2 = 3^3, so a(1) = 2. (No solution can have x = 1 because z^3 - 1 = (z - 1)(z^2 + z + 1) cannot be a square: if a = z - 1, then z^2 + z + 1 = a^2 + 3a + 3 is congruent to 3 modulo any factor of a, and a = 3b yields z^3 - 1 = 9*b*(3*b^2 + 3b + 1), the last factor being congruent to 1 modulo any factor of b, and cannot be a square.) 27^2 + 18^3 = 9^4, so a(2) = 27. 256^3 + 64^4 = 32^5, so a(3) = 256. 472392^4 + 52488^5 = 8748^6, so a(4) = 472392. CROSSREFS Cf. A001105 (2*k^2), A060757 (4^k^2 = 2^(2k^2)), A000244 (3^k). Conjectured to be a subsequence of A003586 (2^i*3^j). Cf. A300564, A300565, A300566, A300567, A300568 (z^4 = x^2 + y^3, ..., z^8 = x^6 + y^7). Sequence in context: A197316 A175529 A267547 * A195604 A011543 A221186 Adjacent sequences:  A302171 A302172 A302173 * A302175 A302176 A302177 KEYWORD nonn,more AUTHOR Jacques Tramu, Apr 07 2018 EXTENSIONS Extended to a(0) = 1 by M. F. Hasler, Apr 13 2018 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 15 11:43 EST 2019. Contains 329999 sequences. (Running on oeis4.)