cp's OEIS Frontend

A196355 Positive integers a for which there is a (1/8)-Pythagorean triple (a,b,c) satisfying a<=b.

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