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.

A275100 Number of set partitions of [3*n] such that within each block the numbers of elements from all residue classes modulo n are equal for n>0, a(0)=1.

Original entry on oeis.org

1, 5, 16, 64, 298, 1540, 8506, 48844, 286498, 1699300, 10136746, 60643324, 363328498, 2178376660, 13065476986, 78378513004, 470228031298, 2821239047620, 16927046865226, 101561118929884, 609363226794898, 3656168900416180, 21936982021437466, 131621797985445964
Offset: 0

Views

Author

Alois P. Heinz, Jul 16 2016

Keywords

Crossrefs

Row n=3 of A275043.

Programs

  • Mathematica
    CoefficientList[Series[-(21x^3-7x^2-5x+1)/((x-1)(6x-1)(3x-1)),{x,0,30}],x] (* Harvey P. Dale, Dec 15 2018 *)

Formula

G.f.: -(21*x^3-7*x^2-5*x+1)/((x-1)*(6*x-1)*(3*x-1)).