A189202 - cp's OEIS frontend

A189202 Let s_k(n) denote the sum of digits of n in base k. Then a(n) is the smallest m>0 such that both s_2(m(n-1)) and s_n(2m*(n-1))/(n-1) are even, or a(n)=0, if such m does not exist.

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

[3, 5, 5, 3, 13, 4, 9, 5, 11, 6, 19, 20, 15, 47, 17, 9, 19, 10, 21, 32, 23, 12, 37, 13, 40, 41, 29, 15, 46, 16, 33, 17, 35, 18, 37, 56, 39, 20, 41, 21, 85, 22, 45, 68, 47, 72, 73, 25, 51, 26, 79, 80, 109, 28, 57, 87, 59, 30, 91, 153, 63, 191, 65, 33, 67, 34, 69]

cp's OEIS Frontend

A189202 Let s_k(n) denote the sum of digits of n in base k. Then a(n) is the smallest m>0 such that both s_2(m(n-1)) and s_n(2m*(n-1))/(n-1) are even, or a(n)=0, if such m does not exist.

Table of values

List of values

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

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

cp's OEIS Frontend

A189202 Let s_k(n) denote the sum of digits of n in base k. Then a(n) is the smallest m>0 such that both s_2(m*(n-1)) and s_n(2*m*(n-1))/(n-1) are even, or a(n)=0, if such m does not exist.

Table of values

List of values

A189202 Let s_k(n) denote the sum of digits of n in base k. Then a(n) is the smallest m>0 such that both s_2(m(n-1)) and s_n(2m*(n-1))/(n-1) are even, or a(n)=0, if such m does not exist.

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