OFFSET
1,1
COMMENTS
Subsequence of odd terms of A026424. - Michel Marcus, Jul 04 2015
The sequence a(1)=0, for n>1 a(n) is smallest number such that for all s,t,m<n a(n) != a(s)*a(t)+a(m) is the same as this one from a(3). - Anders Hellström, Jul 08 2015
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..10000 (first 1000 terms from Harry J. Smith)
FORMULA
a(n) = A369966(n)/2. - Antti Karttunen, Jan 21 2026
EXAMPLE
a(9) = 27, which is odd with an odd number of prime factors, i.e., 3.
MATHEMATICA
Select[Range[1, 301, 2], OddQ[PrimeOmega[#]]&] (* Harvey P. Dale, Feb 15 2025 *)
PROG
(PARI) isok(k) = { k%2 == 1 && bigomega(k)%2 == 1 } \\ Harry J. Smith, Apr 25 2010
(Python)
from math import isqrt, prod
from sympy import primerange, integer_nthroot, primepi
from oeis_sequences.OEISsequences import bisection
def A067019(n):
def g(x, a, b, c, m): yield from (((d, ) for d in enumerate(primerange(b, isqrt(x//c)+1), a)) if m==2 else (((a2, b2), )+d for a2, b2 in enumerate(primerange(b, integer_nthroot(x//c, m)[0]+1), a) for d in g(x, a2, b2, c*b2, m-1)))
def f(x): return int(n+2+sum(sum(primepi(x//prod(c[1] for c in a))-a[-1][0] for a in g(x, 0, 1, 1, m)) for m in range(2, x.bit_length()+1, 2))+sum(sum(primepi((x>>1)//prod(c[1] for c in a))-a[-1][0] for a in g(x>>1, 0, 1, 1, m)) for m in range(2, x.bit_length(), 2)))
return bisection(f, n, n) # Chai Wah Wu, Dec 19 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Shyam Sunder Gupta, Feb 16 2002
STATUS
approved
