A346401 - cp's OEIS frontend

A346401 a(n) is the minimum number of pebbles such that any assignment of those pebbles on a complete graph with n vertices is a next-player winning game in the two-player impartial (3, 2) pebbling game.

n	a(n)
3	13
4	21
5	15
6	21
7	17
8	25
9	21
10	29
11	25
12	33
13	29
14	37
15	33
16	41
17	37
18	45
19	41
20	49
21	45
22	53
23	49
24	57

[13, 21, 15, 21, 17, 25, 21, 29, 25, 33, 29, 37, 33, 41, 37, 45, 41, 49, 45, 53, 49, 57]