A196238 - OEIS

%I #9 Mar 30 2012 18:57:49

%S 1,2,2,3,3,3,4,4,4,4,5,5,5,5,5,6,6,6,6,6,7,7,7,7,7,8,8,8,8,8,8,9,9,9,

%T 9,9,10,10,10,10,10,10,10,10,10,11,11,11,11,11,12,12,12,12,12,12,12,

%U 12,13,13,13,13,14,14,14,14,14,14,14,14,15,15,15,15,15,15,15,15

%N Positive integers a for which there is a 10-Pythagorean triple (a,b,c) satisfying a<=b.

%C See A195770 for definitions of k-Pythagorean triple, primitive k-Pythagorean triple, and lists of related sequences.

%t z8 = 900; z9 = 250; z7 = 200;

%t k = 10; c[a_, b_] := Sqrt[a^2 + b^2 + k*a*b];

%t d[a_, b_] := If[IntegerQ[c[a, b]], {a, b, c[a, b]}, 0]

%t t[a_] := Table[d[a, b], {b, a, z8}]

%t u[n_] := Delete[t[n], Position[t[n], 0]]

%t Table[u[n], {n, 1, 15}]

%t t = Table[u[n], {n, 1, z8}];

%t Flatten[Position[t, {}]]

%t u = Flatten[Delete[t, Position[t, {}]]];

%t x[n_] := u[[3 n - 2]];

%t Table[x[n], {n, 1, z7}]  (* A196238 *)

%t y[n_] := u[[3 n - 1]];

%t Table[y[n], {n, 1, z7}]  (* A196239 *)

%t z[n_] := u[[3 n]];

%t Table[z[n], {n, 1, z7}]  (* A196240 *)

%t x1[n_] := If[GCD[x[n], y[n], z[n]] == 1, x[n], 0]

%t y1[n_] := If[GCD[x[n], y[n], z[n]] == 1, y[n], 0]

%t z1[n_] := If[GCD[x[n], y[n], z[n]] == 1, z[n], 0]

%t f = Table[x1[n], {n, 1, z9}];

%t x2 = Delete[f, Position[f, 0]]  (* A196241 *)

%t g = Table[y1[n], {n, 1, z9}];

%t y2 = Delete[g, Position[g, 0]]  (* A196242 *)

%t h = Table[z1[n], {n, 1, z9}];

%t z2 = Delete[h, Position[h, 0]]  (* A196243 *)

%Y Cf. A195770, A196238, A196240, A196241.

%K nonn

%O 1,2

%A _Clark Kimberling_, Sep 29 2011