A184996 - cp's OEIS frontend

A184996 For each ordered partition of n with k numbers, remove 1 from each part and add the number k to get a new partition, until a partition is repeated. Among all ordered partitions of n, a(n) gives the maximum number of steps needed to reach a period.

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

[0, 1, 3, 5, 7, 8, 9, 11, 13, 15, 15, 16, 17, 22, 24, 24, 22, 23, 26, 33, 35, 35, 29, 30, 31, 38, 46, 48, 48, 41, 38, 39, 43, 52, 61, 63, 63, 55, 47, 48, 49, 58, 68, 78, 80, 80, 71, 62, 58, 59, 64, 75, 86, 97, 99, 99, 89, 79, 69, 70, 71, 82, 94, 106, 118, 120, 120, 109, 98, 87]

cp's OEIS Frontend

A184996 For each ordered partition of n with k numbers, remove 1 from each part and add the number k to get a new partition, until a partition is repeated. Among all ordered partitions of n, a(n) gives the maximum number of steps needed to reach a period.

Table of values

List of values

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

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

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