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.

A318240 Triangle read by rows: T(n,k) = solution to Dagstuhl's Happy Diner Problem with n participants and tables of size at most k (n > k >= 2).

Table of values

n a(n)
3 3
4 3
5 3
6 5
7 3
8 3
9 5
10 4
11 3
12 3
13 7
14 4
15 3
16 3
17 3
18 7
19 4
20 3
21 3
22 3
23 3
24 9
25 4
26 4
27 3
28 3
29 3
30 3
31 9
32 6
33 4
34 4
35 3
36 3
37 3
38 3
39 11
40 6
41 5
42 4
43 3
44 3
45 3
46 3
47 3
48 11
49 6
50 5
51 4
52 3
53 3
54 3
55 3
56 3
57 3
58 13
59 7
60 5
61 5
62 4
63 3
64 3
65 3
66 3
67 3
68 3
69 13
70 7
71 5
72 5
73 4
74 4
75 3
76 3
77 3
78 3
79 3
80 3
81 15
82 7
83 5
84 5
85 4
86 4
87 3

List of values

[3, 3, 3, 5, 3, 3, 5, 4, 3, 3, 7, 4, 3, 3, 3, 7, 4, 3, 3, 3, 3, 9, 4, 4, 3, 3, 3, 3, 9, 6, 4, 4, 3, 3, 3, 3, 11, 6, 5, 4, 3, 3, 3, 3, 3, 11, 6, 5, 4, 3, 3, 3, 3, 3, 3, 13, 7, 5, 5, 4, 3, 3, 3, 3, 3, 3, 13, 7, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 15, 7, 5, 5, 4, 4, 3]