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.

A355757 Smallest n-layered number.

This page as a plain text file.
%I A355757 #36 Jul 20 2022 11:15:42
%S A355757 1,6,120,27720,147026880,130429015516800,1970992304700453905270400,
%T A355757 1897544233056092162003806758651798777216000
%N A355757 Smallest n-layered number.
%C A355757 An integer k is said to be n-layered if the set of all positive divisors of k can be partitioned into n subsets with the same sum.
%H A355757 Farid Jokar, <a href="https://arxiv.org/abs/2207.09053">On k-layered numbers</a>, arXiv:2207.09053 [math.NT], 2022.
%Y A355757 Cf. k-layered numbers: A083207 (k=2), A204830 (k=3), A204831 (k=4).
%K A355757 nonn,hard,more
%O A355757 1,2
%A A355757 _Michel Marcus_, Jul 20 2022