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.

A376664 Least number k such that there are A376663(n) partitions x_1 + ... + x_j = k such that the multinomial coefficient k!/(x_1! * ... * x_j!) is equal to n, i.e., the first row k of A036038 in which n appears A376663(n) times (or 0 if n = 0).

Table of values

n a(n)
1 0
2 2
3 3
4 4
5 5
6 3
7 7
8 8
9 9
10 5
11 11
12 4
13 13
14 14
15 6
16 16
17 17
18 18
19 19
20 5
21 7
22 22
23 23
24 4
25 25
26 26
27 27
28 8
29 29
30 5
31 31
32 32
33 33
34 34
35 7
36 9
37 37
38 38
39 39
40 40
41 41
42 7
43 43
44 44
45 10
46 46
47 47
48 48
49 49
50 50
51 51
52 52
53 53
54 54
55 11
56 8
57 57
58 58
59 59
60 5
61 61
62 62
63 63
64 64
65 65
66 12
67 67
68 68
69 69
70 8
71 71

List of values

[0, 2, 3, 4, 5, 3, 7, 8, 9, 5, 11, 4, 13, 14, 6, 16, 17, 18, 19, 5, 7, 22, 23, 4, 25, 26, 27, 8, 29, 5, 31, 32, 33, 34, 7, 9, 37, 38, 39, 40, 41, 7, 43, 44, 10, 46, 47, 48, 49, 50, 51, 52, 53, 54, 11, 8, 57, 58, 59, 5, 61, 62, 63, 64, 65, 12, 67, 68, 69, 8, 71]