References to A118534

a(n) = largest k such that prime(n+1) = prime(n) + (prime(n) mod k), or 0 if no such k exists.
0, 0, 3, 0, 9, 9, 15, 15, 17, 27, 25, 33, 39, 39, 41, 47, 57, 55, 63, 69, 67, 75, 77, 81, 93

1 seqfan posts