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.

A335201 Unitary Zumkeller numbers (A290466) that are not squarefree.

This page as a plain text file.
%I A335201 #11 May 28 2020 05:27:08
%S A335201 60,90,150,294,420,630,660,726,750,780,840,924,990,1014,1020,1050,
%T A335201 1092,1140,1170,1380,1386,1428,1470,1530,1596,1638,1650,1710,1734,
%U A335201 1740,1860,1890,1950,2058,2070,2142,2166,2220,2460,2550,2580,2610,2790,2820,2850,2940
%N A335201 Unitary Zumkeller numbers (A290466) that are not squarefree.
%C A335201 Zumkeller numbers (A083207) that are squarefree (A005117) are also unitary Zumkeller numbers (A290466), since all of their divisors are unitary.
%C A335201 First differs from A335140 at n = 39.
%H A335201 Amiram Eldar, <a href="/A335201/b335201.txt">Table of n, a(n) for n = 1..10000</a>
%e A335201 60 is a term since it is nonsquarefree, and its unitary divisors, {1, 3, 4, 5, 12, 15, 20, 60}, can be partitioned into 2 disjoint sets whose sum is equal: 1 + 3 + 4 + 5 + 12 + 15 + 20 = 60.
%t A335201 uzQ[n_] :=  Module[{d = Select[Divisors[n], CoprimeQ[#, n/#] &], sum, x}, sum = Plus @@ d; If[sum < 2*n || OddQ[sum], False, CoefficientList[Product[1 + x^i, {i, d}], x][[1 + sum/2]] > 0]]; Select[Range[3000], !SquareFreeQ[#] && uzQ[#] &]
%Y A335201 Intersection of A013929 and A290466.
%Y A335201 Cf. A005117, A083207.
%K A335201 nonn
%O A335201 1,1
%A A335201 _Amiram Eldar_, May 26 2020