A354149 Odd numbers in A090252 in order of appearance.
1, 3, 5, 7, 9, 11, 13, 17, 19, 23, 25, 21, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 55, 79, 27, 49, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 85, 121, 223, 227, 57, 229, 161, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331
Offset: 1
Keywords
Links
- N. J. A. Sloane, Table of n, a(n) for n = 1..9988
Programs
-
Python
from math import gcd, prod from itertools import count, islice def agen(): # generator of terms alst, aset, mink = [1], {1}, 2; yield 1 for n in count(2): k, s = mink, n - n//2 prodall = prod(alst[n-n//2-1:n-1]) while k in aset or gcd(prodall, k) != 1: k += 1 alst.append(k); aset.add(k) if k%2 == 1: yield k while mink in aset: mink += 1 print(list(islice(agen(), 77))) # Michael S. Branicky, May 23 2022