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.

A177922 For each composition (ordered partition) of n, remove the first part z(1) and add 1 to the next z(1) parts to get a new composition until a partition is repeated. Among all compositions of n, a(n) gives the maximum of steps needed to reach a period.

Table of values

n a(n)
1 0
2 2
3 3
4 5
5 7
6 9
7 9
8 11
9 16
10 18
11 18
12 18
13 22
14 28
15 30
16 30
17 25
18 29
19 36
20 43
21 45
22 45
23 39
24 39
25 45
26 53
27 61
28 63
29 63
30 56
31 49
32 55
33 64
34 73
35 82
36 84
37 84
38 76
39 68
40 68
41 76
42 86
43 96
44 106
45 108
46 99
47 90
48 81
49 89
50 100
51 111
52 122
53 133
54 135
55 135
56 125
57 115
58 105
59 105
60 115
61 127
62 139

List of values

[0, 2, 3, 5, 7, 9, 9, 11, 16, 18, 18, 18, 22, 28, 30, 30, 25, 29, 36, 43, 45, 45, 39, 39, 45, 53, 61, 63, 63, 56, 49, 55, 64, 73, 82, 84, 84, 76, 68, 68, 76, 86, 96, 106, 108, 99, 90, 81, 89, 100, 111, 122, 133, 135, 135, 125, 115, 105, 105, 115, 127, 139]