a(n) = largest k such that A000959(n+1) = A000959(n) + (A000959(n) mod k), or 0 if no such k exists.
0, 0, 5, 5, 11, 9, 17, 19, 29, 29, 31, 37, 47, 39, 59, 65, 65, 71, 71, 71, 81, 87, 93, 99
1 seqfan posts
Tue Jan 25 10:23:09 CET 2011 [seqfan] Re: OEISWiki : decomposition into weight * level + jump