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.

A370487 Number of partitions of [3n] into 3 sets of size n having at least one set of consecutive numbers whose maximum (if n>0) is a multiple of n.

Table of values

n a(n)
0 1
1 1
2 7
3 28
4 103
5 376
6 1384
7 5146
8 19303
9 72928
10 277132
11 1058146
12 4056232
13 15600898
14 60174898
15 232676278
16 901620583
17 3500409328
18 13612702948
19 53017895698
20 206769793228
21 807386811658
22 3156148445578
23 12350146091398
24 48371405524648
25 189615909656626
26 743877799422154

List of values

[1, 1, 7, 28, 103, 376, 1384, 5146, 19303, 72928, 277132, 1058146, 4056232, 15600898, 60174898, 232676278, 901620583, 3500409328, 13612702948, 53017895698, 206769793228, 807386811658, 3156148445578, 12350146091398, 48371405524648, 189615909656626, 743877799422154]