cp's OEIS Frontend

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.

Previous Showing 21-30 of 216 results. Next

A196169 Positive integers a for which there is a 7-Pythagorean triple (a,b,c) satisfying a<=b (includes multiplicities).

Original entry on oeis.org

1, 1, 2, 2, 3, 3, 3, 3, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16
Offset: 1

Views

Author

Clark Kimberling, Sep 29 2011

Keywords

Comments

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

Crossrefs

Cf. A195770, A196170, A196171, A196172, A196173, A196174.

Programs

  • Mathematica
    z8 = 900; z9 = 250; z7 = 200;
k = 7; 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}]  (* A196169 *)
y[n_] := u[[3 n - 1]];
Table[y[n], {n, 1, z7}]  (* A196170 *)
z[n_] := u[[3 n]];
Table[z[n], {n, 1, z7}]  (* A196171 *)
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]]  (* A196172 *)
g = Table[y1[n], {n, 1, z9}];
y2 = Delete[g, Position[g, 0]]  (* A196173 *)
h = Table[z1[n], {n, 1, z9}];
z2 = Delete[h, Position[h, 0]]  (* A196174 *)

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

Original entry on oeis.org

1, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18
Offset: 1

Views

Author

Clark Kimberling, Sep 29 2011

Keywords

Comments

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

Crossrefs

Cf. A195770, A196165, A196177, A196178, A196179.

Programs

  • Mathematica
    z8 = 900; z9 = 250; z7 = 200;
k = 8; 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}]  (* A196176 *)
y[n_] := u[[3 n - 1]];
Table[y[n], {n, 1, z7}]  (* A196177 *)
z[n_] := u[[3 n]];
Table[z[n], {n, 1, z7}]  (* A196178 *)
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]]  (* A196179 *)
g = Table[y1[n], {n, 1, z9}];
y2 = Delete[g, Position[g, 0]]  (* A196180 *)
h = Table[z1[n], {n, 1, z9}];
z2 = Delete[h, Position[h, 0]]  (* A196181 *)

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

Original entry on oeis.org

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
Offset: 1

Views

Author

Clark Kimberling, Sep 29 2011

Keywords

Comments

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

Crossrefs

Cf. A195770, A196184, A196185, A196186.

Programs

  • 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 *)

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

Original entry on oeis.org

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, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15
Offset: 1

Views

Author

Clark Kimberling, Sep 29 2011

Keywords

Comments

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

Crossrefs

Cf. A195770, A196238, A196240, A196241.

Programs

  • Mathematica
    z8 = 900; z9 = 250; z7 = 200;
k = 10; 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}]  (* A196238 *)
y[n_] := u[[3 n - 1]];
Table[y[n], {n, 1, z7}]  (* A196239 *)
z[n_] := u[[3 n]];
Table[z[n], {n, 1, z7}]  (* A196240 *)
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]]  (* A196241 *)
g = Table[y1[n], {n, 1, z9}];
y2 = Delete[g, Position[g, 0]]  (* A196242 *)
h = Table[z1[n], {n, 1, z9}];
z2 = Delete[h, Position[h, 0]]  (* A196243 *)

A196245 Positive integers a for which there is a (-3/4)-Pythagorean triple (a,b,c) satisfying a<=b.

Original entry on oeis.org

3, 3, 4, 6, 6, 6, 7, 8, 9, 9, 9, 10, 11, 12, 12, 12, 12, 12, 14, 14, 15, 15, 16, 17, 18, 18, 18, 18, 20, 20, 20, 21, 21, 21, 21, 22, 22, 23, 24, 24, 24, 24, 24, 25, 26, 27, 27, 27, 28, 28, 28, 28, 29, 30, 30, 30, 30, 30, 31, 32, 32, 32, 32, 33, 33, 34, 34, 35, 35, 36
Offset: 1

Views

Author

Clark Kimberling, Sep 30 2011

Keywords

Comments

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

Crossrefs

Cf. A195770, A196247, A196248, A196249.

Programs

  • Mathematica
    z8 = 900; z9 = 250; z7 = 200;
k = -3/4; 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}]  (* A196245 *)
y[n_] := u[[3 n - 1]];
Table[y[n], {n, 1, z7}]  (* A196247 *)
z[n_] := u[[3 n]];
Table[z[n], {n, 1, z7}]  (* A196248 *)
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]]  (* A196249 *)
g = Table[y1[n], {n, 1, z9}];
y2 = Delete[g, Position[g, 0]]  (* A196250 *)
h = Table[z1[n], {n, 1, z9}];
z2 = Delete[h, Position[h, 0]]  (* A196246 *)

A196252 Positive integers a for which there is a (3/4)-Pythagorean triple (a,b,c) satisfying a<=b.

Original entry on oeis.org

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, 21, 21, 22, 23, 24, 24, 24, 25, 26, 26, 27, 27, 28, 28, 28, 28, 30, 30, 30, 31, 32, 32, 32, 33, 33, 34, 34, 35, 35, 36, 36, 36, 36, 36, 38, 38, 39, 40, 40, 40, 42, 42, 42, 42
Offset: 1

Views

Author

Clark Kimberling, Sep 30 2011

Keywords

Comments

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

Crossrefs

Cf. A195770, A196253, A196254, A196255.

Programs

  • Mathematica
    z8 = 900; z9 = 250; z7 = 200;
k = 3/4; 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}]  (* A196252 *)
y[n_] := u[[3 n - 1]];
Table[y[n], {n, 1, z7}]  (* A196253 *)
z[n_] := u[[3 n]];
Table[z[n], {n, 1, z7}]  (* A196254 *)
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]]  (* A196255 *)
g = Table[y1[n], {n, 1, z9}];
y2 = Delete[g, Position[g, 0]]  (* A196256 *)
h = Table[z1[n], {n, 1, z9}];
z2 = Delete[h, Position[h, 0]]  (* A196257 *)

A196259 Positive integers a in (1/4)-Pythagorean triples (a,b,c) satisfying a<=b, in order of increasing a and then increasing b.

Original entry on oeis.org

2, 4, 4, 5, 6, 6, 7, 7, 8, 8, 9, 10, 10, 10, 11, 12, 12, 12, 12, 13, 14, 14, 14, 15, 15, 15, 16, 16, 17, 18, 18, 18, 19, 20, 20, 20, 20, 20, 20, 21, 21, 22, 22, 22, 22, 23, 23, 24, 24, 24, 24, 25, 25, 25, 26, 26, 26, 27, 28, 28, 28, 28, 28, 29, 30, 30, 30, 30, 30, 30, 31, 31, 32, 32, 32, 32, 32
Offset: 1

Views

Author

Clark Kimberling, Sep 30 2011

Keywords

Comments

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

Links

Crossrefs

Cf. A195770, A196260, A196261, A196262.

Programs

  • Maple
    F:= proc(a)
  sort(select(t -> subs(t,b) >= a and subs(t,c) > 0, [isolve](4*a^2 + 4*b^2 + a*b = 4*c^2)),(s,t) -> subs(s,b) <= subs(t,b))
end proc:
seq(a$nops(F(a)), a=1..40); # Robert Israel, Dec 18 2024
  • Mathematica
    (* Warning: this code is incorrect, as it imposes a limit b <= 900 *)
z8 = 900; z9 = 250; z7 = 200;
k = 1/4; 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}]  (* A196259 *)
y[n_] := u[[3 n - 1]];
Table[y[n], {n, 1, z7}]  (* A196260 *)
z[n_] := u[[3 n]];
Table[z[n], {n, 1, z7}]  (* A196261 *)
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]]  (* A196262 *)
g = Table[y1[n], {n, 1, z9}];
y2 = Delete[g, Position[g, 0]]  (* A196263 *)
h = Table[z1[n], {n, 1, z9}];
z2 = Delete[h, Position[h, 0]]  (* A196264 *)

Extensions

Corrected by Robert Israel, Dec 18 2024

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

Original entry on oeis.org

1, 2, 3, 4, 4, 5, 6, 6, 7, 8, 8, 9, 9, 10, 10, 10, 11, 11, 12, 12, 12, 12, 13, 13, 14, 14, 15, 15, 16, 16, 17, 17, 18, 18, 18, 19, 19, 20, 20, 20, 20, 20, 20, 21, 22, 22, 22, 23, 23, 23, 24, 24, 24, 24, 25, 25, 26, 26, 26, 27, 28, 28, 28, 28, 28, 29, 29, 30, 30, 30, 30
Offset: 1

Views

Author

Clark Kimberling, Sep 30 2011

Keywords

Comments

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

Crossrefs

Cf. A195770, A196267, A196268, A196269.

Programs

  • Mathematica
    k = -1/4; 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}]  (* A196266 *)
y[n_] := u[[3 n - 1]];
Table[y[n], {n, 1, z7}]  (* A196267 *)
z[n_] := u[[3 n]];
Table[z[n], {n, 1, z7}]  (* A196268 *)
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]]  (* A196269 *)
g = Table[y1[n], {n, 1, z9}];
y2 = Delete[g, Position[g, 0]]  (* A196270 *)
h = Table[z1[n], {n, 1, z9}];
z2 = Delete[h, Position[h, 0]]  (* A196271 *)

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

Original entry on oeis.org

5, 5, 7, 8, 9, 9, 10, 10, 11, 14, 15, 15, 15, 15, 16, 16, 16, 17, 17, 18, 18, 19, 20, 20, 21, 21, 22, 24, 24, 25, 25, 25, 25, 25, 25, 27, 28, 29, 30, 30, 30, 30, 31, 31, 32, 32, 32, 33, 34, 35, 35, 35, 35, 35, 36, 37, 38, 39, 39, 40, 40, 40, 40, 40, 41, 42, 42, 44
Offset: 1

Views

Author

Clark Kimberling, Oct 01 2011

Keywords

Comments

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

Crossrefs

Cf. A195770, A196351.

Programs

  • Mathematica
    z8 = 900; z9 = 250; z7 = 200;
k = 1/5; 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}]  (* A196348 *)
y[n_] := u[[3 n - 1]];
Table[y[n], {n, 1, z7}]  (* A196349 *)
z[n_] := u[[3 n]];
Table[z[n], {n, 1, z7}]  (* A196350 *)
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]]  (* A196351 *)
g = Table[y1[n], {n, 1, z9}];
y2 = Delete[g, Position[g, 0]]  (* A196352 *)
h = Table[z1[n], {n, 1, z9}];
z2 = Delete[h, Position[h, 0]]  (* A196353 *)

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

Original entry on oeis.org

4, 6, 8, 8, 8, 10, 11, 12, 12, 12, 12, 13, 13, 14, 14, 15, 16, 16, 16, 17, 18, 20, 20, 21, 22, 24, 24, 24, 24, 24, 24, 26, 26, 27, 28, 28, 28, 29, 30, 30, 30, 31, 32, 32, 32, 33, 34, 35, 36, 36, 36, 36, 38, 39, 39, 40, 40, 40, 40, 40, 42, 42, 42, 43, 44, 44, 44, 45
Offset: 1

Views

Author

Clark Kimberling, Oct 01 2011

Keywords

Comments

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

Crossrefs

Cf. A195770, A196356, A196357, A196358.

Programs

  • Mathematica
    z8 = 900; z9 = 250; z7 = 200;
k = 1/8; 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}]  (* A196355 *)
y[n_] := u[[3 n - 1]];
Table[y[n], {n, 1, z7}]  (* A196356 *)
z[n_] := u[[3 n]];
Table[z[n], {n, 1, z7}]  (* A196357 *)
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]]  (* A196358 *)
g = Table[y1[n], {n, 1, z9}];
y2 = Delete[g, Position[g, 0]]  (* A196359 *)
h = Table[z1[n], {n, 1, z9}];
z2 = Delete[h, Position[h, 0]]  (* A196360 *)
Previous Showing 21-30 of 216 results. Next

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.