a(n) = largest k such that A000290(n+1) = A000290(n) + (A000290(n) mod k), or 0 if no such k exists.
0, 0, 0, 0, 14, 23, 34, 47, 62, 79, 98, 119, 142, 167, 194, 223, 254, 287, 322, 359, 398
1 seqfan posts
Tue Jan 25 10:23:09 CET 2011 [seqfan] Re: OEISWiki : decomposition into weight * level + jump