**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*

Index of A-numbers in seqfan: by ascending order by month by frequency by keyword

Links to OEIS content are included according to The OEIS End-User License Agreement .