a(n) = largest k such that A002808(n+1) = A002808(n) + (A002808(n) mod k), or 0 if no such k exists.
0, 4, 7, 8, 8, 10, 13, 14, 14, 16, 19, 20, 20, 23, 24, 25, 26, 26, 28, 31, 32, 33, 34, 34
1 seqfan posts
Tue Jan 25 10:23:09 CET 2011 [seqfan] Re: OEISWiki : decomposition into weight * level + jump