

A196183


Positive integers a for which there is a 9Pythagorean triple (a,b,c) satisfying a<=b.


7



1, 2, 3, 3, 3, 3, 3, 4, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 11, 11, 12, 12, 12, 12, 12, 13, 13, 13, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 18, 18, 18, 18, 18, 18, 19, 19, 19
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

See A195770 for definitions of kPythagorean triple, primitive kPythagorean triple, and lists of related sequences.


LINKS

Table of n, a(n) for n=1..76.


MATHEMATICA

z8 = 900; z9 = 250; z7 = 200;
k = 9; c[a_, b_] := Sqrt[a^2 + b^2 + k*a*b];
d[a_, b_] := If[IntegerQ[c[a, b]], {a, b, c[a, b]}, 0]
t[a_] := Table[d[a, b], {b, a, z8}]
u[n_] := Delete[t[n], Position[t[n], 0]]
Table[u[n], {n, 1, 15}]
t = Table[u[n], {n, 1, z8}];
Flatten[Position[t, {}]]
u = Flatten[Delete[t, Position[t, {}]]];
x[n_] := u[[3 n  2]];
Table[x[n], {n, 1, z7}] (* A196183 *)
y[n_] := u[[3 n  1]];
Table[y[n], {n, 1, z7}] (* A196184 *)
z[n_] := u[[3 n]];
Table[z[n], {n, 1, z7}] (* A196185 *)
x1[n_] := If[GCD[x[n], y[n], z[n]] == 1, x[n], 0]
y1[n_] := If[GCD[x[n], y[n], z[n]] == 1, y[n], 0]
z1[n_] := If[GCD[x[n], y[n], z[n]] == 1, z[n], 0]
f = Table[x1[n], {n, 1, z9}];
x2 = Delete[f, Position[f, 0]] (* A196186 *)
g = Table[y1[n], {n, 1, z9}];
y2 = Delete[g, Position[g, 0]] (* A196187 *)
h = Table[z1[n], {n, 1, z9}];
z2 = Delete[h, Position[h, 0]] (* A196188 *)


CROSSREFS

Cf. A195770, A196184, A196185, A196186.
Sequence in context: A109785 A058224 A131808 * A200264 A104406 A080344
Adjacent sequences: A196180 A196181 A196182 * A196184 A196185 A196186


KEYWORD

nonn


AUTHOR

Clark Kimberling, Sep 29 2011


STATUS

approved



