This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A244713 #13 Oct 31 2016 10:22:00
%S A244713 1,4,7,10,13,16,18,19,22,25,27,28,31,34,37,40,43,45,46,49,52,54,55,58,
%T A244713 61,64,67,70,72,73,76,79,81,82,85,88,91,94,97,99,100,103,106,108,109,
%U A244713 112,115,118,121,124,126,127,130,133,135,136,139,142,145,148,151
%N A244713 Positive numbers primitively represented by the binary quadratic form (1, 1, -2).
%C A244713 Discriminant = 9.
%H A244713 Ray Chandler, <a href="/A244713/b244713.txt">Table of n, a(n) for n = 1..10000</a>
%H A244713 N. J. A. Sloane et al., <a href="https://oeis.org/wiki/Binary_Quadratic_Forms_and_OEIS">Binary Quadratic Forms and OEIS</a> (Index to related sequences, programs, references)
%F A244713 Conjectures from _Colin Barker_, Oct 31 2016: (Start)
%F A244713 a(n) = a(n-1)+a(n-11)-a(n-12) for n>12.
%F A244713 G.f.: (1 +2*x)*(1 +x +x^2)*(1 +x^3 +x^7) / ((1 -x)^2*(1 +x +x^2 +x^3 +x^4 +x^5 +x^6 +x^7 +x^8 +x^9 +x^10)).
%F A244713 (End)
%t A244713 Reap[For[n = 1, n < 1000, n++, r = Reduce[x^2 + x y - 2 y^2 == n, {x, y}, Integers]; If[r =!= False, If[AnyTrue[{x, y} /. {ToRules[r /. C[1] -> 0]}, CoprimeQ @@ # &], Sow[n]]]]][[2, 1]] (* _Jean-François Alcover_, Oct 31 2016 *)
%Y A244713 Cf. A002476, A007645. A subsequence of A056991 and A242660.
%K A244713 nonn
%O A244713 1,2
%A A244713 _Peter Luschny_, Jul 04 2014