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.

A275101 Number of set partitions of [4*n] 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 15
2 131
3 1613
4 25097
5 461105
6 9483041
7 209175233
8 4802367617
9 112660505345
10 2672797504001
11 63775070743553
12 1526140298561537
13 36573850636201985
14 877130337148149761
15 21043423870122115073
16 504949726500343545857
17 12117684104978986369025

List of values

[1, 15, 131, 1613, 25097, 461105, 9483041, 209175233, 4802367617, 112660505345, 2672797504001, 63775070743553, 1526140298561537, 36573850636201985, 877130337148149761, 21043423870122115073, 504949726500343545857, 12117684104978986369025]