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 A195918 #8 Mar 30 2012 18:57:48 %S A195918 2,3,4,5,6,6,7,8,9,9,10,10,10,11,12,12,13,14,14,15,15,15,15,15,16,16, %T A195918 17,18,18,18,18,19,20,20,20,21,21,22,22,22,23,24,24,25,25,26,26,26,27, %U A195918 27,27,28,28,29,30,30,30,30,30,30,30,30,32,32,32,32,33,33,33,34 %N A195918 Positive integers a for which there is a (-3/2)-Pythagorean triple (a,b,c) satisfying a<=b. %C A195918 See A195770 for definitions of k-Pythagorean triple, primitive k-Pythagorean triple, and lists of related sequences. %t A195918 z8 = 800; z9 = 400; z7 = 100; %t A195918 k = -3/2; c[a_, b_] := Sqrt[a^2 + b^2 + k*a*b]; %t A195918 d[a_, b_] := If[IntegerQ[c[a, b]], {a, b, c[a, b]}, 0] %t A195918 t[a_] := Table[d[a, b], {b, a, z8}] %t A195918 u[n_] := Delete[t[n], Position[t[n], 0]] %t A195918 Table[u[n], {n, 1, 15}] %t A195918 t = Table[u[n], {n, 1, z8}]; %t A195918 Flatten[Position[t, {}]] %t A195918 u = Flatten[Delete[t, Position[t, {}]]]; %t A195918 x[n_] := u[[3 n - 2]]; %t A195918 Table[x[n], {n, 1, z7}] (* A195918 *) %t A195918 y[n_] := u[[3 n - 1]]; %t A195918 Table[y[n], {n, 1, z7}] (* A195919 *) %t A195918 z[n_] := u[[3 n]]; %t A195918 Table[z[n], {n, 1, z7}] (* A195920 *) %t A195918 x1[n_] := If[GCD[x[n], y[n], z[n]] == 1, x[n], 0] %t A195918 y1[n_] := If[GCD[x[n], y[n], z[n]] == 1, y[n], 0] %t A195918 z1[n_] := If[GCD[x[n], y[n], z[n]] == 1, z[n], 0] %t A195918 f = Table[x1[n], {n, 1, z9}]; %t A195918 x2 = Delete[f, Position[f, 0]] (* A195921 *) %t A195918 g = Table[y1[n], {n, 1, z9}]; %t A195918 y2 = Delete[g, Position[g, 0]] (* A195922 *) %t A195918 h = Table[z1[n], {n, 1, z9}]; %t A195918 z2 = Delete[h, Position[h, 0]] (* A195923 *) %Y A195918 Cf. A195770, A195919, A195920, A195921. %K A195918 nonn %O A195918 1,1 %A A195918 _Clark Kimberling_, Sep 26 2011