**Let a(n) = d[m(n),i] the i-th divisor of the integer m(n) and the index j such that d[m(n),i] = d[m(n+1),j], m(n+1) is the first integer > m(n). The sequence a(n), starting with m(1) = 1, i = 1 is given by the conditions: a(1) = 1 and a(n+1) is the first predecessor of a(n) if n even, or the first successor of a(n) if n odd.**

*1, 2, 1, 5, 2, 3, 1, 2, 1, 19, 2, 4, 2, 23, 3, 4, 2, 3, 1, 2, 1, 5, 3, 31, 4, 8, 4, 5, 1, 2, 1, 149*

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