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.

A275097 Number of set partitions of [8*n] such that within each block the numbers of elements from all residue classes modulo 8 are equal.

Original entry on oeis.org

1, 1, 129, 286498, 4802367617, 386652630390626, 112344305783644570242, 96703375432646667737903621, 213426677887357366350726096998529, 1081530653290057746718498987187644516546, 11534313393388449518393789691807687515711518754
Offset: 0

Views

Author

Alois P. Heinz, Jul 16 2016

Keywords

Crossrefs

Column k=8 of A275043.

Programs

  • Maple
    a:= proc(n) option remember; `if`(n=0, 1, add(
          binomial(n, j)^8*(n-j)*a(j), j=0..n-1)/n)
        end:
    seq(a(n), n=0..12);

Formula

Sum_{n>=0} a(n) * x^n / (n!)^8 = exp(Sum_{n>=1} x^n / (n!)^8). - Ilya Gutkovskiy, Jul 17 2020