A371781 Numbers with biquanimous prime signature.

1, 6, 10, 14, 15, 21, 22, 26, 33, 34, 35, 36, 38, 39, 46, 51, 55, 57, 58, 60, 62, 65, 69, 74, 77, 82, 84, 85, 86, 87, 90, 91, 93, 94, 95, 100, 106, 111, 115, 118, 119, 122, 123, 126, 129, 132, 133, 134, 140, 141, 142, 143, 145, 146, 150, 155, 156, 158, 159

Offset: 1

Author

Gus Wiseman, Apr 09 2024

Keywords

• nonn

Comments

First differs from A320911 in lacking 900.

First differs from A325259 in having 1 and lacking 120.

A finite multiset of numbers is defined to be biquanimous iff it can be partitioned into two multisets with equal sums. Biquanimous partitions are counted by A002219 (aerated) and ranked by A357976.

Also numbers n with a unitary divisor d|n having exactly half as many prime factors as n, counting multiplicity.

Examples

			The prime signature of 120 is (3,1,1), which is not biquanimous, so 120 is not in the sequence.
		

Links

• Robert Israel, Table of n, a(n) for n = 1..10000

Crossrefs

A number's prime signature is given by A124010.

For prime indices we have A357976, counted by A002219 aerated.

The complement for prime indices is A371731, counted by A371795, A006827.

The complement is A371782, counted by A371840.

Partitions of this type are counted by A371839.

A112798 lists prime indices, reverse A296150, length A001222, sum A056239.

A237258 aerated counts biquanimous strict partitions, ranks A357854.

A321142 and A371794 count non-biquanimous strict partitions.

A321451 counts non-quanimous partitions, ranks A321453.

A321452 counts quanimous partitions, ranks A321454.

A371783 counts k-quanimous partitions.

A371791 counts biquanimous sets, complement A371792.

Cf. A035470, A064914, A232466, A299702, A336137, A371737, A371796.

Subsequence of A028260.

Programs

Maple

biquanimous:= proc(L) local s,x,i,P; option remember;
  s:= convert(L,`+`); if s::odd then return false fi;
  P:= mul(1+x^i,i=L);
  coeff(P,x,s/2) > 0
end proc:
select(n -> biquanimous(ifactors(n)[2][..,2]), [$1..200]); # Robert Israel, Apr 22 2024

Mathematica

g[n_]:=Select[Divisors[n],GCD[#,n/#]==1&&PrimeOmega[#]==PrimeOmega[n/#]&];
Select[Range[100],g[#]!={}&]
(* second program: *)
q[n_] := Module[{e = FactorInteger[n][[;; , 2]], sum, x}, sum = Plus @@ e; EvenQ[sum] && CoefficientList[Product[1 + x^i, {i, e}], x][[1 + sum/2]] > 0]; q[1] = True; Select[Range[200], q] (* Amiram Eldar, Jul 24 2024 *)