a(n) = smallest k such that A000326(n+1) = A000326(n) + (A000326(n) mod k), or 0 if no such k exists.
0, 0, 0, 0, 19, 32, 24, 67, 89, 38, 71, 173, 69, 61, 71, 109, 373, 211, 79, 529, 587, 72
1 seqfan posts
Tue Jan 25 10:23:09 CET 2011 [seqfan] Re: OEISWiki : decomposition into weight * level + jump