a(0)=1. Let S = string of digits of a(0),a(1),a(2),... To get a(n+1) (n>=0), subtract next element of S from a(n) if that would give a positive number different from a(0),...,a(n), otherwise add it to a(n).
1, 2, 4, 8, 16, 15, 9, 8, 3, 12, 4, 1, 0, 2, 6, 5, 5, 3, 9, 4, 9, 6, 15, 11, 2, 8, 7, 2, 1, 0, 2
1 seqfan posts
Fri Mar 16 19:38:36 CET 2012 [seqfan] Re: Recaman's transform of its own digits