A251739 - cp's OEIS frontend

A251739 Smallest k such that n * sum(i=0..k, binomial(k,i) mod (n-1) ) <= 2^n.

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

[1, 4, 3, 6, 5, 8, 7, 8, 9, 10, 10, 9, 10, 10, 10, 11, 11, 11, 12, 11, 12, 11, 11, 12, 13, 12, 11, 13, 12, 13, 13, 13, 12, 13, 13, 14, 13, 14, 13, 14, 14, 14, 14, 14, 14, 15, 15, 15, 14, 14, 15, 14, 15, 15, 15, 15, 16, 15]

cp's OEIS Frontend

A251739 Smallest k such that n * sum(i=0..k, binomial(k,i) mod (n-1) ) <= 2^n.

Table of values

List of values

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

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

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