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.

A321230 Number of set partitions of [n^2] into n n-element subsets having the same sum.

This page as a plain text file.
%I A321230 #13 Nov 02 2018 12:38:58
%S A321230 1,1,1,2,392,3245664,6534071578530
%N A321230 Number of set partitions of [n^2] into n n-element subsets having the same sum.
%H A321230 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>
%F A321230 a(n) = A203986(n,n).
%e A321230 a(0) = 1: empty.
%e A321230 a(1) = 1: 1.
%e A321230 a(2) = 1: 14|23.
%e A321230 a(3) = 2: 168|249|357, 159|267|348.
%Y A321230 Main diagonal of A203986.
%Y A321230 Cf. A006003, A037270, A052456, A104185, A321282.
%K A321230 nonn,more
%O A321230 0,4
%A A321230 _Alois P. Heinz_, Oct 31 2018