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.

Table of values

n a(n)
0 1
1 5
2 16
3 64
4 298
5 1540
6 8506
7 48844
8 286498
9 1699300
10 10136746
11 60643324
12 363328498
13 2178376660
14 13065476986
15 78378513004
16 470228031298
17 2821239047620
18 16927046865226
19 101561118929884
20 609363226794898
21 3656168900416180
22 21936982021437466
23 131621797985445964

List of values

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