A236411 - cp's OEIS frontend

A236411 Let p(k) denote the k-th prime; a(n) = smallest p(m) > p(n) such that the n-2 differences between [p(n), p(n+1), ..., p(2n-2)] are the same as the n-2 differences between [p(m), p(m+1), ..., p(m+n-2)].

n	a(n)
2	5
3	11
4	13
5	101
6	37
7	1277
8	1279
9	1616603
10	57405419
11	51448351
12	76623356077
13	115438255651991
14	433241801791933

[5, 11, 13, 101, 37, 1277, 1279, 1616603, 57405419, 51448351, 76623356077, 115438255651991, 433241801791933]