A356879 Numbers k such that the sum k^x + k^y can be a square with {x, y} >= 0.

0, 2, 3, 8, 15, 18, 24, 32, 35, 48, 50, 63, 72, 80, 98, 99, 120, 128, 143, 162, 168, 195, 200, 224, 242, 255, 288, 323, 338, 360, 392, 399, 440, 450, 483, 512, 528, 575, 578, 624, 648, 675, 722, 728, 783, 800, 840, 882, 899, 960, 968, 1023, 1058, 1088, 1152, 1155, 1224

Offset

0,2

Comments

Characteristics of the terms:

- Any x combined with any y is a solution.

This special case is valid only for k = 0 (exception: x = y = 0).

- Any x is possible and if x is odd: y = x. If x is even: y = x + 3.

This special case is valid only for k = 2 (see A356880).

- Only even x combined with y = x + 1 gives a solution.

Those terms are the terms of A132411.

- Only odd x combined with y = x gives a solution.

Those terms are the terms of A001105.

- Any x is possible and if x is odd: y = x. If x is even: y = x + 1.

Those terms are the terms of A132592.

Links

Table of n, a(n) for n=0..56.

Example

Squares that can be produced with k = 8: 8^0 + 8^1 = 9; 8^1 + 8^1 = 16; 8^2 + 8^3 = 576; 8^3 + 8^3 = 1024; 8^4 + 8^5 = 36864; 8^5 + 8^5 = 65536; 8^6 + 8^7 = 2359296, ....

Mathematica

Select[Range[0, 1225], IntegerQ[Sqrt[# + 1]] || IntegerQ[Sqrt[#/2]] &] (* Amiram Eldar, Sep 18 2022 *)

Prog

(Python)
from gmpy2 import is_square
print([n for n in range(0, 1225) if is_square(n+1) or (n % 2 == 0 and is_square(n//2))])

Crossrefs

Cf. A132411 is a subsequence (except A132411(1)), A001105 is a subsequence.

Cf. A132592 is a subsequence.

Cf. A356880 (k = 2), A270473 (k = 3).

Sequence in context: A004731 A135354 A240974 * A293688 A285223 A122412

Adjacent sequences: A356876 A356877 A356878 * A356880 A356881 A356882

Keyword

nonn

Author

Karl-Heinz Hofmann, Sep 12 2022

Status

approved