login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A323341 Numbers k whose unitary divisors have an even sum which is larger than 2k, but they cannot be partitioned into two disjoint parts whose sums are equal. 5

%I #12 Mar 25 2023 05:30:09

%S 2394,1452330,5771934,5786298,5800662,5834178,5843754,5858118,5886846,

%T 5905998,5920362,5929938,5992182,6035274,6059214,6078366,6087942,

%U 6102306,6107094,6121458,6174126,6202854,6207642,6245946,6265098,6274674,6303402,6336918,6360858

%N Numbers k whose unitary divisors have an even sum which is larger than 2k, but they cannot be partitioned into two disjoint parts whose sums are equal.

%H Amiram Eldar, <a href="/A323341/b323341.txt">Table of n, a(n) for n = 1..10000</a>

%t usigma[n_] := If[n == 1, 1, Times @@ (1 + Power @@@ FactorInteger[n])]; seq={}; Do[s=usigma[n]; If[OddQ[s] || s<=2n, Continue[]]; udiv = Select[Divisors[n], GCD[ #, n/# ] == 1 &]; If[Coefficient[Times @@ (1 + x^udiv) // Expand, x, s/2] == 0, AppendTo[seq, n]], {n, 1, 1500000}]; seq

%Y The unitary version of A171641.

%Y Cf. A034448, A034683, A290466, A323342, A323343, A323344.

%K nonn

%O 1,1

%A _Amiram Eldar_, Jan 11 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 16:42 EDT 2024. Contains 371989 sequences. (Running on oeis4.)