A363235 - cp's OEIS frontend

A363235 a(0) = 1; let e be the largest multiplicity such that p^e | a(n); for n>0, a(n) = Sum_{j=1..k} 2^(e(j)-1) where k is the index of the greatest power factor p(k)^e(k) such that p(k-1)^e(k-1) > p(k)^(e(k)+1).

n	a(n)
0	0
1	1
2	2
3	3
4	4
5	5
6	8
7	9
8	10
9	11
10	16
11	17
12	18
13	19
14	20
15	21
16	22
17	23
18	32
19	33
20	34
21	35
22	36
23	37
24	38
25	39
26	64
27	65
28	66
29	67
30	68
31	69
32	70
33	71
34	72
35	73
36	74
37	75
38	128
39	129
40	130
41	131
42	132
43	133
44	134
45	135
46	136
47	137
48	138
49	139
50	144
51	145
52	146
53	147
54	148
55	149
56	150
57	151
58	256
59	257
60	258
61	259
62	260
63	261
64	262
65	263
66	264
67	265
68	266
69	267

[0, 1, 2, 3, 4, 5, 8, 9, 10, 11, 16, 17, 18, 19, 20, 21, 22, 23, 32, 33, 34, 35, 36, 37, 38, 39, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 144, 145, 146, 147, 148, 149, 150, 151, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267]

cp's OEIS Frontend

A363235 a(0) = 1; let e be the largest multiplicity such that p^e | a(n); for n>0, a(n) = Sum_{j=1..k} 2^(e(j)-1) where k is the index of the greatest power factor p(k)^e(k) such that p(k-1)^e(k-1) > p(k)^(e(k)+1).

Table of values

List of values

n	a(n)
0	0
1	1
2	2
3	3
4	4
5	5
6	8
7	9
8	10
9	11
10	16
11	17
12	18
13	19
14	20
15	21
16	22
17	23
18	32
19	33
20	34
21	35
22	36
23	37
24	38
25	39
26	64
27	65
28	66
29	67
30	68
31	69
32	70
33	71
34	72
35	73
36	74
37	75
38	128
39	129
40	130
41	131
42	132
43	133
44	134
45	135
46	136
47	137
48	138
49	139
50	144
51	145
52	146
53	147
54	148
55	149
56	150
57	151
58	256
59	257
60	258
61	259
62	260
63	261
64	262
65	263
66	264
67	265
68	266
69	267

n	a(n)
0	0
1	1
2	2
3	3
4	4
5	5
6	8
7	9
8	10
9	11
10	16
11	17
12	18
13	19
14	20
15	21
16	22
17	23
18	32
19	33
20	34
21	35
22	36
23	37
24	38
25	39
26	64
27	65
28	66
29	67
30	68
31	69
32	70
33	71
34	72
35	73
36	74
37	75
38	128
39	129
40	130
41	131
42	132
43	133
44	134
45	135
46	136
47	137
48	138
49	139
50	144
51	145
52	146
53	147
54	148
55	149
56	150
57	151
58	256
59	257
60	258
61	259
62	260
63	261
64	262
65	263
66	264
67	265
68	266
69	267

n	a(n)
0	0
1	1
2	2
3	3
4	4
5	5
6	8
7	9
8	10
9	11
10	16
11	17
12	18
13	19
14	20
15	21
16	22
17	23
18	32
19	33
20	34
21	35
22	36
23	37
24	38
25	39
26	64
27	65
28	66
29	67
30	68
31	69
32	70
33	71
34	72
35	73
36	74
37	75
38	128
39	129
40	130
41	131
42	132
43	133
44	134
45	135
46	136
47	137
48	138
49	139
50	144
51	145
52	146
53	147
54	148
55	149
56	150
57	151
58	256
59	257
60	258
61	259
62	260
63	261
64	262
65	263
66	264
67	265
68	266
69	267