login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A364965
Odd numbers k such that k is a multiple of A243071(k).
2
3, 27, 315, 3003, 42757, 72765, 195195, 799425, 13873275, 18131225
OFFSET
1,1
PROG
(PARI)
A243071(n) = if(n<=2, n-1, my(f=factor(n), p, p2=1, res=0); for(i=1, #f~, p = 1 << (primepi(f[i, 1]) - 1); res += (p*p2*(2^(f[i, 2]) - 1)); p2 <<= f[i, 2]); ((3<<#binary(res\2))-res-1)); \\ (Combining programs given in A156552 and A054429)
isA364965(n) = ((n>1)&&(n%2)&&!(n%A243071(n)));
CROSSREFS
Odd terms in A364964.
Sequence A163511(A364495(n)), for n>1, sorted into ascending order.
Cf. A243071.
Cf. also A364498, A364551.
Sequence in context: A290576 A291315 A378686 * A078532 A264684 A376529
KEYWORD
nonn,more
AUTHOR
Antti Karttunen, Sep 01 2023
STATUS
approved