A376953 - cp's OEIS frontend

A376953 a(n) = least k such that (n*Pi/3)^(2k)/(2 k)! < 1.

n	a(n)
0	1
1	1
2	2
3	4
4	5
5	6
6	8
7	9
8	11
9	12
10	13
11	15
12	16
13	18
14	19
15	20
16	22
17	23
18	25
19	26
20	27
21	29
22	30
23	32
24	33
25	35
26	36
27	37
28	39
29	40
30	42
31	43
32	44
33	46
34	47
35	49
36	50
37	52
38	53
39	54
40	56
41	57
42	59
43	60
44	61
45	63
46	64
47	66
48	67
49	69
50	70
51	71
52	73
53	74
54	76
55	77
56	78
57	80
58	81
59	83
60	84
61	86
62	87
63	88
64	90
65	91
66	93

[1, 1, 2, 4, 5, 6, 8, 9, 11, 12, 13, 15, 16, 18, 19, 20, 22, 23, 25, 26, 27, 29, 30, 32, 33, 35, 36, 37, 39, 40, 42, 43, 44, 46, 47, 49, 50, 52, 53, 54, 56, 57, 59, 60, 61, 63, 64, 66, 67, 69, 70, 71, 73, 74, 76, 77, 78, 80, 81, 83, 84, 86, 87, 88, 90, 91, 93]

cp's OEIS Frontend

A376953 a(n) = least k such that (n*Pi/3)^(2k)/(2 k)! < 1.

Table of values

List of values

n	a(n)
0	1
1	1
2	2
3	4
4	5
5	6
6	8
7	9
8	11
9	12
10	13
11	15
12	16
13	18
14	19
15	20
16	22
17	23
18	25
19	26
20	27
21	29
22	30
23	32
24	33
25	35
26	36
27	37
28	39
29	40
30	42
31	43
32	44
33	46
34	47
35	49
36	50
37	52
38	53
39	54
40	56
41	57
42	59
43	60
44	61
45	63
46	64
47	66
48	67
49	69
50	70
51	71
52	73
53	74
54	76
55	77
56	78
57	80
58	81
59	83
60	84
61	86
62	87
63	88
64	90
65	91
66	93

n	a(n)
0	1
1	1
2	2
3	4
4	5
5	6
6	8
7	9
8	11
9	12
10	13
11	15
12	16
13	18
14	19
15	20
16	22
17	23
18	25
19	26
20	27
21	29
22	30
23	32
24	33
25	35
26	36
27	37
28	39
29	40
30	42
31	43
32	44
33	46
34	47
35	49
36	50
37	52
38	53
39	54
40	56
41	57
42	59
43	60
44	61
45	63
46	64
47	66
48	67
49	69
50	70
51	71
52	73
53	74
54	76
55	77
56	78
57	80
58	81
59	83
60	84
61	86
62	87
63	88
64	90
65	91
66	93

n	a(n)
0	1
1	1
2	2
3	4
4	5
5	6
6	8
7	9
8	11
9	12
10	13
11	15
12	16
13	18
14	19
15	20
16	22
17	23
18	25
19	26
20	27
21	29
22	30
23	32
24	33
25	35
26	36
27	37
28	39
29	40
30	42
31	43
32	44
33	46
34	47
35	49
36	50
37	52
38	53
39	54
40	56
41	57
42	59
43	60
44	61
45	63
46	64
47	66
48	67
49	69
50	70
51	71
52	73
53	74
54	76
55	77
56	78
57	80
58	81
59	83
60	84
61	86
62	87
63	88
64	90
65	91
66	93