cp's OEIS Frontend

A339690 Positive integers of the form 4^i*9^j*k with gcd(k,6)=1.

%I A339690 #57 Apr 04 2025 06:34:23
%S A339690 1,4,5,7,9,11,13,16,17,19,20,23,25,28,29,31,35,36,37,41,43,44,45,47,
%T A339690 49,52,53,55,59,61,63,64,65,67,68,71,73,76,77,79,80,81,83,85,89,91,92,
%U A339690 95,97,99,100,101,103,107,109,112,113,115,116,117,119,121
%N A339690 Positive integers of the form 4^i*9^j*k with gcd(k,6)=1.
%C A339690 Positive integers that survive sieving by the rule: if m appears then 2m, 3m and 6m do not.
%C A339690 Numbers whose squarefree part is congruent to 1 or 5 modulo 6.
%C A339690 Closed under multiplication.
%C A339690 Term by term, the sequence is one half of its complement within A007417, one third of its complement within A003159, and one sixth of its complement within A036668.
%C A339690 Asymptotic density is 1/2.
%C A339690 The set of all a(n) has maximal lower density (1/2) among sets S such that S, 2S, and 3S are disjoint.
%C A339690 Numbers which do not have 2 or 3 in their Fermi-Dirac factorization. Thus each term is a product of a unique subset of A050376 \ {2,3}.
%C A339690 It follows that the sequence is closed with respect to the commutative binary operation A059897(.,.), forming a subgroup of the positive integers considered as a group under A059897. It is the subgroup generated by A050376 \ {2,3}. A003159, A007417 and A036668 correspond to the nontrivial subgroups of its quotient group. It is the lexicographically earliest ordered transversal of the subgroup {1,2,3,6}, which in ordered form is the lexicographically earliest subgroup of order 4.
%H A339690 Jan Snellman, <a href="https://arxiv.org/abs/2504.02795">Greedy Regular Convolutions</a>, arXiv:2504.02795 [math.NT], 2025.
%H A339690 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Group.html">Group</a>.
%H A339690 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/SquarefreePart.html">Squarefree Part</a>.
%H A339690 <a href="/index/Si#sieve">Index entries for sequences generated by sieves</a>
%F A339690 {a(n) : n >= 1} = {m : A307150(m) = 6m, m >= 0}.
%F A339690 {a(n) : n >= 1} = {k : k = A052330(4m), m >= 0}.
%F A339690 A329575(n) = a(n) * 3.
%F A339690 {A036668(n) : n >= 0} = {a(n) : n >= 1} U {6 * a(n) : n >= 1}.
%F A339690 {A003159(n) : n >= 1} = {a(n) : n >= 1} U {3 * a(n) : n >= 1}.
%F A339690 {A007417(n) : n >= 1} = {a(n) : n >= 1} U {2 * a(n) : n >= 1}.
%F A339690 a(n) ~ 2n.
%e A339690 Numbers are removed by the sieve only due to the presence of a smaller number, so 1 is in the sequence as the smallest positive integer. The sieve removes 2, as it is twice 1, which is in the sequence; so 2 is not in the sequence. The sieve removes 3, as it is three times 1, which is in the sequence, so 3 is not in the sequence. There are no integers m for which 3m = 4 or 6m = 4; 2m = 4 for m = 2, but 2 is not in the sequence; so the sieve does not remove 4, so 4 is in the sequence.
%t A339690 Select[Range[117], EvenQ[IntegerExponent[#, 2]] && EvenQ[IntegerExponent[#, 3]] &]
%t A339690 f[p_, e_] := p^Mod[e, 2]; core[n_] := Times @@ f @@@ FactorInteger[n]; Select[Range[121], CoprimeQ[core[#], 6] &] (* _Amiram Eldar_, Feb 06 2021 *)
%o A339690 (PARI) isok(m) = core(m) % 6 == 1 || core(m) % 6 == 5;
%o A339690 (Python)
%o A339690 from itertools import count
%o A339690 from sympy import integer_log
%o A339690 def A339690(n):
%o A339690     def bisection(f,kmin=0,kmax=1):
%o A339690         while f(kmax) > kmax: kmax <<= 1
%o A339690         kmin = kmax >> 1
%o A339690         while kmax-kmin > 1:
%o A339690             kmid = kmax+kmin>>1
%o A339690             if f(kmid) <= kmid:
%o A339690                 kmax = kmid
%o A339690             else:
%o A339690                 kmin = kmid
%o A339690         return kmax
%o A339690     def f(x):
%o A339690         c = n+x
%o A339690         for i in range(integer_log(x,9)[0]+1):
%o A339690             i2 = 9**i
%o A339690             for j in count(0,2):
%o A339690                 k = i2<<j
%o A339690                 if k>x:
%o A339690                     break
%o A339690                 m = x//k
%o A339690                 c -= (m-1)//6+(m-5)//6+2
%o A339690         return c
%o A339690     return bisection(f,n,n) # _Chai Wah Wu_, Feb 14 2025
%Y A339690 Cf. A050376, A059897, A307150, A339746, A372574 (characteristic function).
%Y A339690 Ordered first quadrisection of A052330.
%Y A339690 Intersection of any 2 of A003159, A007417 and A036668.
%Y A339690 A329575 divided by 3.
%K A339690 nonn
%O A339690 1,2
%A A339690 _Griffin N. Macris_, Dec 13 2020, and _Peter Munn_, Feb 03 2021