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.

A227538 Smallest k such that a partition of n into distinct parts with perimeter k exists.

Table of values

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

List of values

[0, 1, 2, 3, 4, 5, 4, 7, 8, 6, 5, 9, 8, 9, 7, 6, 11, 12, 9, 10, 8, 7, 11, 12, 13, 10, 11, 9, 8, 15, 12, 13, 14, 11, 12, 10, 9, 16, 17, 13, 14, 15, 12, 13, 11, 10, 16, 17, 18, 14, 15, 16, 13, 14, 12, 11, 16, 17, 18, 19, 15, 16, 17, 14, 15, 13, 12, 22, 17, 18, 19]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.