A277642 Number of solutions of the Diophantine equation x^2 + 2^a * 5^b * 13^c = y^A277641(n) for nonnegative a, b, c with x, y > 0 and gcd(x, y) = 1.

38, 10, 1, 4, 1, 2, 1

Offset

1,1

Comments

See Theorem 1 in Goins, Luca, Togbe.

Links

Table of n, a(n) for n=1..7.

E. Goins, F. Luca and A. Togbe, On the Diophantine Equation x^2 + 2^alpha 5^beta 13^gamma = y^n, in: A. J. van der Poorten and Andreas Stein, Algorithmic Number Theory, Springer-Verlag Berlin Heidelberg, 2008, DOI: 10.1007/978-3-540-79456-1

E. Goins, F. Luca and A. Togbe, On the Diophantine Equation x^2 + 2^alpha 5^beta 13^gamma = y^n, in: A. Shallue, "An Improved Multi-set Algorithm for the Dense Subset Sum Problem", Springer-Verlag, 430-442

Crossrefs

Cf. A277641.

Sequence in context: A225433 A225398 A037936 * A160147 A033358 A033974

Adjacent sequences: A277639 A277640 A277641 * A277643 A277644 A277645

Keyword

nonn,fini,full

Author

Felix Fröhlich, Oct 25 2016

Status

approved