A256504 - cp's OEIS frontend

A256504 Summative Fission - For a positive integer n, find the greatest number of consecutive positive integers (at least 2) which add to n. For each of these do the same ... iterate to completion. a(n) = the total number of integers (including n itself) defined.

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

[0, 1, 1, 3, 1, 5, 6, 5, 1, 6, 7, 12, 10, 12, 11, 12, 1, 8, 16, 14, 17, 18, 18, 23, 13, 21, 18, 22, 23, 24, 19, 14, 1, 22, 20, 23, 24, 31, 27, 25, 26, 36, 28, 37, 29, 30, 42, 37, 22, 32, 37, 38, 35, 41, 36, 37, 43, 42, 37, 44, 44, 34, 33, 47, 1, 48, 49, 43, 53]

cp's OEIS Frontend

A256504 Summative Fission - For a positive integer n, find the greatest number of consecutive positive integers (at least 2) which add to n. For each of these do the same ... iterate to completion. a(n) = the total number of integers (including n itself) defined.

Table of values

List of values

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

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

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