a(n) = largest k such that A000961(n+1) = A000961(n) + (A000961(n) mod k), or 0 if no such k exists.
0, 0, 2, 3, 3, 6, 7, 7, 9, 10, 15, 15, 15, 21, 23, 25, 27, 30, 27, 33, 39, 39, 45, 45, 47, 57
1 seqfan posts
Tue Jan 25 10:23:09 CET 2011 [seqfan] Re: OEISWiki : decomposition into weight * level + jump