cp's OEIS Frontend

A364286 Composite numbers k for which A324644(k)/A324198(k) = 2.

%I A364286 #23 Mar 10 2024 20:01:30
%S A364286 33,51,69,91,99,135,141,145,153,159,187,207,213,217,285,295,303,321,
%T A364286 339,391,411,423,427,435,445,477,507,519,573,637,639,679,681,699,771,
%U A364286 783,799,843,855,861,885,895,901,909,933,951,963,1017,1041,1057,1059,1071,1081,1083,1147,1149,1173,1185,1195,1203,1207
%N A364286 Composite numbers k for which A324644(k)/A324198(k) = 2.
%C A364286 See comments in A351458.
%C A364286 All terms are odd. Of the 63 initial terms of A349169, only term 13923 occurs also in this sequence. The first common term with A332458 is 161257. - _Antti Karttunen_, Mar 10 2024
%H A364286 Antti Karttunen, <a href="/A364286/b364286.txt">Table of n, a(n) for n = 1..20000</a>
%H A364286 <a href="/index/O#opnseqs">Index entries for sequences where odd perfect numbers must occur, if they exist at all</a>
%H A364286 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%H A364286 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%t A364286 f[x_] := Block[{m, i, n = x, p}, m = i = 1; While[n > 0, p = Prime[i]; m *= p^Mod[n, p]; n = Quotient[n, p]; i++]; m]; Select[Select[Range[1350], CompositeQ], GCD[#2, #3]/GCD[#1, #3] == 2 & @@ {#, DivisorSigma[1, #], f[#]} &] (* _Michael De Vlieger_, Mar 10 2024 *)
%o A364286 (PARI)
%o A364286 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A364286 isA364286(n) = if(isprime(n), 0, my(u=A276086(n)); (gcd(sigma(n),u)==2*gcd(n,u))); \\ _Antti Karttunen_, Mar 10 2024
%Y A364286 Cf. A000203, A276086, A324198, A324644, A332458, A349169, A351458, A371082 (subsequence).
%Y A364286 Subsequence of A082686.
%K A364286 nonn
%O A364286 1,1
%A A364286 _Antti Karttunen_, Jul 17 2023