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.

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

Original entry on oeis.org

1, 1, 1, 9, 2650, 100664383, 808087012923418
Offset: 0

Views

Author

Alois P. Heinz, Nov 01 2018

Keywords

Examples

			a(3) = 9: 12345|69|78, 1239|456|78, 1248|357|69, 1257|348|69, 1347|258|69, 1356|249|78, 159|2346|78, 168|249|357, 159|267|348.
		

Crossrefs

Programs

  • Maple
    b:= proc(l, n) option remember; `if`(n=0, 1, add(`if`(n>l[j],
           0, b(sort(subsop(j=l[j]-n, l)), n-1)), j=1..nops(l)))
        end:
    a:= n-> b([n*(1+n^2)/2$n], n^2)/n!:
    seq(a(n), n=0..5);
  • Mathematica
    b[l_, n_] := b[l, n] = If[n == 0, 1, Sum[If[n > l[[j]], 0, b[Sort[ ReplacePart[l, j -> l[[j]] - n]], n-1]], {j, 1, Length[l]}]];
    a[n_] := b[Table[n(1+n^2)/2, {n}], n^2]/n!;
    a /@ Range[0, 5] (* Jean-François Alcover, May 04 2020, after Maple *)

Formula

a(n) = A275714(n^2,n).