Alonso Del Arte (Re: A077342): > I believe I may at least be able to figure out which a(n) = n. This is what I've come up with: > a(n) = n when n > 10 * floor(n/10) + floor(n/10) - 2. More to the point, empirically there appear to be only 64 solutions, the largest 109.