A374061 Number of solutions to a^2 + n = 2 * b^2 with 0 < a < b.

0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 2

Offset: 1

Author

Seiichi Manyama, Jun 27 2024

Keywords

• nonn
• easy

Examples

			3^2 + 119 = 2 * 8^2 and 9^2 + 119 = 2 * 10^2. So a(119) = 2.
		

Links

• Seiichi Manyama, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A331671.