A347637 - cp's OEIS frontend

A347637 Table read by ascending antidiagonals. T(n, k) 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 (k+1, k) pebbling game. T(n, k) for n >= 5 and k >= 1.

n	a(n)
5	7
6	13
7	15
8	9
9	21
10	21
11	15
12	17
13	35
14	27
15	11
16	25
17	25
18	37
19	33
20	17
21	21
22	41
23	33
24	59
25	39
26	13
27	29
28	31
29	45
30	41
31	53

[7, 13, 15, 9, 21, 21, 15, 17, 35, 27, 11, 25, 25, 37, 33, 17, 21, 41, 33, 59, 39, 13, 29, 31, 45, 41, 53]