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.

A188160 For an unordered partition of n with k parts, remove 1 from each part and append the number k to get a new partition until a partition is repeated. a(n) gives the maximum steps to reach a period considering all unordered partitions of n.

Table of values

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

List of values

[0, 1, 2, 4, 5, 6, 7, 8, 10, 12, 12, 12, 13, 18, 20, 20, 17, 18, 21, 28, 30, 30, 24, 24, 25, 32, 40, 42, 42, 35, 31, 32, 36, 45, 54, 56, 56, 48, 40, 40, 41, 50, 60, 70, 72, 72, 63, 54, 49, 50, 55, 66, 77, 88, 90, 90, 80, 70, 60, 60, 61]

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

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