a(n) = largest k such that A014612(n+1) = A014612(n) + (A014612(n) mod k), or 0 if no such k exists.
0, 0, 16, 13, 26, 26, 18, 40, 43, 40, 48, 41, 60, 64, 66, 65, 74, 74, 64, 86, 97, 96, 99
1 seqfan posts
Tue Jan 25 10:23:09 CET 2011 [seqfan] Re: OEISWiki : decomposition into weight * level + jump