OFFSET
1,1
COMMENTS
If p is an odd prime < 2^m and A365475(m) exists, then p * A365475(m) is a term. Thus, if A365475 is infinite, this sequence contains infinitely many multiples of every odd prime.
Being the intersection of A001358 and A235040 (as stated by the original author), these are odd semiprimes p*q such that p*q = A048720(p,q), where A048720 is the carryless binary multiplication. - Antti Karttunen, Dec 07 2025
LINKS
EXAMPLE
MAPLE
g:= proc(n) convert(convert(n, base, 2), `+`) end proc:
N:= 10^4: # for terms <= N
S:= NULL: p:= 2:
while 3*p <= N do
p:= nextprime(p);
t:= g(p);
q:= 2:
do
q:= nextprime(q);
if q = p or q*p > N then break fi;
if g(q)*t = g(p*q) then S:= S, p*q fi;
od od:
sort([S]);
PROG
(PARI) is_A365473(n) = if(!(n%2) || 2!=bigomega(n), 0, my(f=factor(n), a = f[1, 1], b = f[#f~, 1]); (hammingweight(n)==hammingweight(a)*hammingweight(b))); \\ Antti Karttunen, Dec 07 2025
(PARI)
A048720(b, c) = fromdigits(Vec(Pol(binary(b))*Pol(binary(c)))%2, 2);
is_A365473(n) = if(!(n%2) || 2!=bigomega(n), 0, my(f=factor(n), a = f[1, 1], b = f[#f~, 1]); (n==A048720(a, b))); \\ Antti Karttunen, Dec 07 2025
CROSSREFS
Subsequence of A391253.
KEYWORD
nonn,base
AUTHOR
Robert Israel, Sep 04 2023
STATUS
approved
