a(n) = smallest k such that A005117(n+1) = A005117(n) + (A005117(n) mod k), or 0 if no such k exists.
0, 0, 0, 2, 5, 4, 3, 3, 2, 13, 13, 3, 17, 2, 3, 4, 23, 2, 29, 29, 2, 3, 3, 2, 37, 37, 2, 41, 4, 3
1 seqfan posts
Tue Jan 25 10:23:09 CET 2011 [seqfan] Re: OEISWiki : decomposition into weight * level + jump