Numbers n such that for every k the following condition holds: (*) The number of nonnegative solutions of the Diophantine equation x^2 + n*y^2 = 1+n*k^2 equals one half of the number of divisors of 1+n*k^2 if 1+n*k^2 is not a square and one half of 1 + the number of divisors of 1+n*k^2 if 1+n*k^2 is a square.
A067069
Numbers n such that for every k the following condition holds: (*) The number of nonnegative solutions of the Diophantine equation x^2 + n*y^2 = 1+n*k^2 equals one half of the number of divisors of 1+n*k^2 if 1+n*k^2 is not a square and one half of 1 + the number of divisors of 1+n*k^2 if 1+n*k^2 is a square.
Terms
- a(0) =2a(1) =3a(2) =4a(3) =6a(4) =8a(5) =10a(6) =12a(7) =16a(8) =18a(9) =22a(10) =24a(11) =28a(12) =30a(13) =40a(14) =42a(15) =48a(16) =58a(17) =60a(18) =70a(19) =72a(20) =78a(21) =88a(22) =102a(23) =112a(24) =120a(25) =130a(26) =168a(27) =190a(28) =210a(29) =232
External references
- oeis: A067069