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.

A335202 Unitary Zumkeller numbers (A290466) whose set of unitary divisors can be partitioned into two disjoint sets of equal sum in a single way.

This page as a plain text file.
%I A335202 #11 May 30 2020 13:51:46
%S A335202 6,60,70,90,3230,3770,4030,4510,5170,5390,5830,50388,87360,269990,
%T A335202 442365,544310,592670,740870,1341230,1772870,4173070,4199030,5719266,
%U A335202 5728842,5743206,34473582,624032630,812851182,1109686930,1113445430,2280959890,55157757606
%N A335202 Unitary Zumkeller numbers (A290466) whose set of unitary divisors can be partitioned into two disjoint sets of equal sum in a single way.
%H A335202 Giovanni Resta, <a href="/A335202/b335202.txt">Table of n, a(n) for n = 1..48</a> (terms < 10^12)
%e A335202 60 is a term since there is only one partition of its set of unitary divisors, {1, 3, 4, 5, 12, 15, 20, 60}, into 2 disjoint sets whose sum is equal: 1 + 3 + 4 + 5 + 12 + 15 + 20 = 60.
%t A335202 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]] == 2]]; Select[Range[6000], uzQ]
%Y A335202 The unitary version of A083209.
%Y A335202 Subsequence of A290466.
%Y A335202 A002827 is a subsequence.
%K A335202 nonn
%O A335202 1,1
%A A335202 _Amiram Eldar_, May 26 2020
%E A335202 Terms a(19) and beyond from _Giovanni Resta_, May 30 2020