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.

A364053 Zumkeller numbers whose divisors can be partitioned into two disjoint sets with equal products.

This page as a plain text file.
%I A364053 #11 Jul 28 2024 03:49:57
%S A364053 6,24,30,40,42,54,56,60,66,70,78,84,88,90,96,102,104,108,114,120,126,
%T A364053 132,138,140,150,156,160,168,174,186,198,204,210,216,220,222,224,228,
%U A364053 234,240,246,258,260,264,270,276,280,282,294,306,308,312,318,330,336,340,342,348,350,352
%N A364053 Zumkeller numbers whose divisors can be partitioned into two disjoint sets with equal products.
%C A364053 Intersection of A083207 and A048943.
%e A364053 The divisors of 24 are {1,2,3,4,6,8,12,24}. They can be partitioned into two disjoint sets with equal sums, namely {4,6,8,12} and {1,2,3,24}, and two disjoint sets with equal products, namely {1,2,12,24} and {3,4,6,8}. So, 24 is a term and also a term of A347063.
%t A364053 zQ[n_]:=Module[{d=Divisors[n],t,ds,x},ds=Plus@@d;If[Mod[ds,2]>0,False,t=CoefficientList[Product[1+x^i,{i,d}],x];t[[1+ds/2]]>0]]; fQ[n_]:=IntegerQ[Sqrt[Times@@Divisors[n]]];
%t A364053 Select[Range[1000],And[fQ[#],zQ[#]]&] (*zQ and fQ by T. D. Noe at A083207 and A048943*)
%Y A364053 Cf. A083207, A048943, A347063.
%K A364053 nonn
%O A364053 1,1
%A A364053 _Ivan N. Ianakiev_, Jul 04 2023