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.

A275073 Number of set partitions of [n] such that i-j is a multiple of six for all i,j belonging to the same block.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 1
7 2
8 4
9 8
10 16
11 32
12 64
13 160
14 400
15 1000
16 2500
17 6250
18 15625
19 46875
20 140625
21 421875
22 1265625
23 3796875
24 11390625
25 39487500
26 136890000
27 474552000
28 1645113600
29 5703060480
30 19770609664
31 77181418496
32 301304383744
33 1176245959616
34 4591883265424

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 4, 8, 16, 32, 64, 160, 400, 1000, 2500, 6250, 15625, 46875, 140625, 421875, 1265625, 3796875, 11390625, 39487500, 136890000, 474552000, 1645113600, 5703060480, 19770609664, 77181418496, 301304383744, 1176245959616, 4591883265424]