References to A117078

a(n) = smallest k such that prime(n+1) = prime(n) + (prime(n) mod k), or 0 if no such k exists.
0, 0, 3, 0, 3, 9, 3, 5, 17, 3, 25, 11, 3, 13, 41, 47, 3, 11, 7, 3, 67, 5, 7, 9, 31, 3, 9, 3, 5

1 seqfan posts