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.

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

Table of values

n a(n)
0 1
1 1
2 3
3 64
4 25097
5 350813126
6 293327384637282
7 22208366234650578141209
8 213426677887357366350726096998529
9 344735749788852590196707169431958672823413322
10 118966637603805785518622376062965559343297730169187276656138

List of values

[1, 1, 3, 64, 25097, 350813126, 293327384637282, 22208366234650578141209, 213426677887357366350726096998529, 344735749788852590196707169431958672823413322, 118966637603805785518622376062965559343297730169187276656138]