-
Notifications
You must be signed in to change notification settings - Fork 6
/
A134624.java
38 lines (32 loc) · 907 Bytes
/
A134624.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
package irvine.oeis.a134;
import java.util.TreeSet;
import irvine.math.z.Z;
import irvine.oeis.Sequence1;
/**
* A134624 a(1) = 1. a(n) = the smallest integer which is > a(n-1) and is different from and not coprime to A134623(n-1).
* @author Sean A. Irvine
*/
public class A134624 extends Sequence1 {
private final TreeSet<Z> mA134624 = new TreeSet<>();
private Z mA134623 = null;
protected Z select(final Z a134623, final Z a136424) {
return a136424;
}
@Override
public Z next() {
if (mA134624.isEmpty()) {
mA134624.add(Z.ONE);
mA134623 = Z.TWO;
} else {
Z t = mA134624.last();
do {
t = t.add(1);
} while (t.equals(mA134623) || Z.ONE.equals(t.gcd(mA134623)));
mA134624.add(t);
do {
mA134623 = mA134623.add(1);
} while (mA134624.contains(mA134623));
}
return select(mA134623, mA134624.last());
}
}