a(n) = largest 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, 48, 67, 89, 114, 142, 173, 207, 244, 284, 327, 373, 422, 474, 529
1 seqfan posts
Tue Jan 25 10:23:09 CET 2011 [seqfan] Re: OEISWiki : decomposition into weight * level + jump