a(n) = largest k such that A005117(n+1) = A005117(n) + (A005117(n) mod k), or 0 if no such k exists.
0, 0, 0, 4, 5, 4, 9, 9, 12, 13, 13, 15, 17, 20, 21, 20, 23, 28, 29, 29, 32, 33, 33, 36, 37
1 seqfan posts
Tue Jan 25 10:23:09 CET 2011 [seqfan] Re: OEISWiki : decomposition into weight * level + jump