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.

A317254 a(n) is the smallest integer such that for all s >= a(n), there are at least n-1 different partitions of s into n parts, namely {x_{11},x_{12},...,x_{1n}}, {x_{21},x_{22},...,x_{2n}},..., and {x_{n-1,1},x_{n-1,2},...,x_{n-1,n}}, such that the products of every set are equal.

Table of values

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

List of values

[19, 23, 23, 26, 27, 29, 31, 32, 35, 36, 38, 40, 42, 44, 45, 47, 49, 50, 52, 53, 54, 55, 57, 58, 59, 61, 62, 63, 64, 66, 67, 69, 70, 71, 73, 74, 75, 77, 78, 80, 81, 82, 84, 85, 86, 87, 88, 89, 90, 91, 93, 94, 95, 96, 97, 99, 100, 101]