cp's OEIS Frontend

A370650 Numbers whose number of infinitary divisors that are terms of A366242 is equal to the number of infinitary divisors that are terms of A366243.

%I A370650 #9 Feb 25 2024 10:42:42
%S A370650 1,8,12,18,20,27,28,44,45,50,52,63,64,68,75,76,92,98,99,116,117,124,
%T A370650 125,144,147,148,153,164,171,172,175,188,207,212,216,236,242,244,245,
%U A370650 261,268,275,279,284,292,316,324,325,332,333,338,343,356,360,363,369,387,388,400
%N A370650 Numbers whose number of infinitary divisors that are terms of A366242 is equal to the number of infinitary divisors that are terms of A366243.
%C A370650 Numbers k such that A366308(k) = A366309(k).
%C A370650 Numbers k such that A366246(k) = A366247(k) = A064547(k)/2.
%C A370650 If k is a term, then all the numbers with the same prime signature as k are terms. The least terms with each prime signature are listed in A370651.
%C A370650 p^A039004(k) is a term for all primes p and all k >= 1.
%H A370650 Amiram Eldar, <a href="/A370650/b370650.txt">Table of n, a(n) for n = 1..10000</a>
%t A370650 s1[0] = 0; s1[n_] := s1[n] = s1[Floor[n/4]] + If[OddQ[Mod[n, 4]], 1, 0]; f1[p_, e_] := s1[e]; a1[1] = 0; a1[n_] := Plus  @@ f1 @@@ FactorInteger[n];
%t A370650 s2[0] = 0; s2[n_] := s2[n] = s2[Floor[n/4]] + If[Mod[n, 4] > 1, 1, 0]; f2[p_, e_] := s2[e]; a2[1] = 0; a2[n_] := Plus @@ f2 @@@ FactorInteger[n];
%t A370650 q[n_] := a1[n] == a2[n]; Select[Range[400], q]
%Y A370650 Cf. A037445, A039004, A064547, A366242, A366243, A366246, A366247, A366308, A366309.
%Y A370650 A370651 is a subsequence.
%K A370650 nonn
%O A370650 1,2
%A A370650 _Amiram Eldar_, Feb 24 2024