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.

A370368 Total sum over all j in [n] of the number of partitions of [j*(n-j)] into (n-j) sets of size j having no set of consecutive numbers whose maximum (if j>0) is a multiple of j.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 3
5 18
6 347
7 20679
8 4064088
9 3206794270
10 9817417580226
11 147957639234186793
12 9515125170594095021483
13 3369265619091187775505912588
14 5792039079391869138256364232105952
15 55416702792637442337898498177490975722265

List of values

[1, 1, 1, 1, 3, 18, 347, 20679, 4064088, 3206794270, 9817417580226, 147957639234186793, 9515125170594095021483, 3369265619091187775505912588, 5792039079391869138256364232105952, 55416702792637442337898498177490975722265]