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