cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

704, 1458, 2394, 7544, 10184, 46400, 60416, 106434, 115182, 118098, 121014, 125000, 129762, 141426, 147258, 150174, 156006, 158922, 164754, 176418, 185166, 190998, 199746, 202662, 217242, 220158, 228906, 237654, 243486, 246402, 252234, 260982, 263898, 278478
Offset: 1

Views

Author

Amiram Eldar, Jan 11 2019

Keywords

Comments

The bi-unitary version of A171641.

Crossrefs

Programs

  • Mathematica
    f[n_] := Select[Divisors[n], Function[d, CoprimeQ[d, n/d]]]; bdiv[n_] := Select[Divisors[n], Last@Intersection[f@#, f[n/#]] == 1 &]; fun[p_, e_] := If[OddQ[e], (p^(e+1)-1)/(p-1), (p^(e+1)-1)/(p-1)-p^(e/2)]; bsigma[n_] := If[n==1, 1, Times @@ (fun @@@ FactorInteger[n])]; seq={}; Do[s=bsigma[n]; If[OddQ[s] || s<=2n, Continue[]]; div = bdiv[n]; If[Coefficient[Times @@ (1 + x^div) // Expand, x, s/2] == 0, AppendTo[seq, n]], {n, 1, 10000}]; seq