A356480 - cp's OEIS frontend

A356480 a(n) is the minimal number of river crossings necessary to solve the missionaries and cannibals problem for n missionaries and n cannibals where the boat capacity is the minimum necessary to allow a solution.

n	a(n)
1	1
2	5
3	11
4	9
5	11
6	9
7	11
8	13
9	15
10	17
11	19
12	21
13	23
14	25
15	27
16	29
17	31
18	33
19	35
20	37
21	39
22	41
23	43
24	45
25	47
26	49
27	51
28	53
29	55
30	57
31	59
32	61
33	63
34	65
35	67
36	69
37	71
38	73
39	75
40	77
41	79
42	81
43	83
44	85
45	87
46	89
47	91
48	93
49	95
50	97
51	99
52	101
53	103
54	105
55	107
56	109
57	111
58	113
59	115
60	117
61	119
62	121
63	123
64	125
65	127
66	129
67	131
68	133
69	135

[1, 5, 11, 9, 11, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109, 111, 113, 115, 117, 119, 121, 123, 125, 127, 129, 131, 133, 135]

cp's OEIS Frontend

A356480 a(n) is the minimal number of river crossings necessary to solve the missionaries and cannibals problem for n missionaries and n cannibals where the boat capacity is the minimum necessary to allow a solution.

Table of values

List of values

n	a(n)
1	1
2	5
3	11
4	9
5	11
6	9
7	11
8	13
9	15
10	17
11	19
12	21
13	23
14	25
15	27
16	29
17	31
18	33
19	35
20	37
21	39
22	41
23	43
24	45
25	47
26	49
27	51
28	53
29	55
30	57
31	59
32	61
33	63
34	65
35	67
36	69
37	71
38	73
39	75
40	77
41	79
42	81
43	83
44	85
45	87
46	89
47	91
48	93
49	95
50	97
51	99
52	101
53	103
54	105
55	107
56	109
57	111
58	113
59	115
60	117
61	119
62	121
63	123
64	125
65	127
66	129
67	131
68	133
69	135

n	a(n)
1	1
2	5
3	11
4	9
5	11
6	9
7	11
8	13
9	15
10	17
11	19
12	21
13	23
14	25
15	27
16	29
17	31
18	33
19	35
20	37
21	39
22	41
23	43
24	45
25	47
26	49
27	51
28	53
29	55
30	57
31	59
32	61
33	63
34	65
35	67
36	69
37	71
38	73
39	75
40	77
41	79
42	81
43	83
44	85
45	87
46	89
47	91
48	93
49	95
50	97
51	99
52	101
53	103
54	105
55	107
56	109
57	111
58	113
59	115
60	117
61	119
62	121
63	123
64	125
65	127
66	129
67	131
68	133
69	135

n	a(n)
1	1
2	5
3	11
4	9
5	11
6	9
7	11
8	13
9	15
10	17
11	19
12	21
13	23
14	25
15	27
16	29
17	31
18	33
19	35
20	37
21	39
22	41
23	43
24	45
25	47
26	49
27	51
28	53
29	55
30	57
31	59
32	61
33	63
34	65
35	67
36	69
37	71
38	73
39	75
40	77
41	79
42	81
43	83
44	85
45	87
46	89
47	91
48	93
49	95
50	97
51	99
52	101
53	103
54	105
55	107
56	109
57	111
58	113
59	115
60	117
61	119
62	121
63	123
64	125
65	127
66	129
67	131
68	133
69	135