a(n) = smallest k such that A000961(n+1) = A000961(n) + (A000961(n) mod k), or 0 if no such k exists.
0, 0, 2, 3, 3, 2, 7, 7, 3, 5, 3, 3, 5, 3, 23, 5, 3, 2, 9, 11, 3, 13, 3, 5, 47, 3, 29, 61, 7, 3, 67
1 seqfan posts
Tue Jan 25 10:23:09 CET 2011 [seqfan] Re: OEISWiki : decomposition into weight * level + jump