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.

A320618 Number of ordered set partitions of [n] where k = five is minimal such that for each block b the smallest integer interval containing b has at most k elements.

Table of values

n a(n)
5 75
6 870
7 8760
8 90084
9 998560
10 12043772
11 155970678
12 2155709610
13 31695391776
14 494515357842
15 8168550752022
16 142500961444392
17 2619097176333672
18 50601139406075592
19 1025475335759015016
20 21756722754354930024
21 482359980950031673440
22 11156266866807100122120

List of values

[75, 870, 8760, 90084, 998560, 12043772, 155970678, 2155709610, 31695391776, 494515357842, 8168550752022, 142500961444392, 2619097176333672, 50601139406075592, 1025475335759015016, 21756722754354930024, 482359980950031673440, 11156266866807100122120]