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.

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

Table of values

n a(n)
0 1
1 1
2 257
3 1699300
4 112660505345
5 44687884101953126
6 76502602935955053437072
7 451167428778794282789329512425
8 7771744024861563765933540267436016385
9 344735749788852590196707169431958672823413322
10 35650419033178479865362827431736721104304210986866382

List of values

[1, 1, 257, 1699300, 112660505345, 44687884101953126, 76502602935955053437072, 451167428778794282789329512425, 7771744024861563765933540267436016385, 344735749788852590196707169431958672823413322, 35650419033178479865362827431736721104304210986866382]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.