cp's OEIS Frontend

A351499 Odd m in A352928.

%I A351499 #11 May 03 2022 23:36:48
%S A351499 1,9,15,75,105,315,525,735,945,1155,1365,1575,1995,3465,4305,5775,
%T A351499 6615,7035,8085,8925,9765,10395,11235,12495,12705,13545,15015,19635,
%U A351499 26565,28875,31185,33495,38115,45045,255255,405405,525525,765765,975975,1036035,1786785,2297295
%N A351499 Odd m in A352928.
%t A351499 nn = 2^20; c = {1}; j = 1; s = 0; u = 1; {1}~Join~Reap[Do[k = u; While[Nand[FreeQ[c, k], CoprimeQ[j, k], k != j + 1], k++]; j = k; AppendTo[c, k]; If[k == u, If[OddQ[u], Sow[u]]; While[MemberQ[c, u], u++]; c = DeleteCases[c, _?(# < u &)]], {i, 2, nn}]][[-1, -1]]
%o A351499 (Python)
%o A351499 from math import gcd
%o A351499 from itertools import islice
%o A351499 def agen(): # generator of terms
%o A351499     an, aset, mink, seen = 1, {1}, 2, {1}
%o A351499     yield 1
%o A351499     while True:
%o A351499         if mink%2 and mink not in seen: yield mink; seen.add(mink)
%o A351499         k = mink
%o A351499         while k in aset or gcd(an, k) != 1 or k-an == 1: k += 1
%o A351499         an = k; aset.add(an)
%o A351499         while mink in aset: mink += 1
%o A351499 print(list(islice(agen(), 42))) # _Michael S. Branicky_, May 03 2022
%Y A351499 Cf. A093714, A351498, A352928.
%K A351499 nonn
%O A351499 1,2
%A A351499 _Michael De Vlieger_, May 03 2022