Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #8 Feb 02 2018 09:01:57
%S 0,0,1,0,2,0,1,0,3,0,1,2,2,0,1,0,4,0,1,0,0,0,4,0,0,0,0,0,0,0,0,0,0,5,
%T 0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,11,0,
%U 0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0
%N Number of positive integers k < n such that n occurs in the Reverse-and-Add trajectory of k.
%C Number of integers k < n such that n occurs in row k of A243238.
%C For n > 0, a(n) = 0 iff n is a term of A067031.
%C For n > 0, a(n) > 0 iff n is a term of A067030.
%H <a href="/index/Res#RAA">Index entries for sequences related to Reverse and Add!</a>
%e For n = 22: There exist 4 positive integers k < 22 such that 22 occurs in the Reverse-and-Add trajectory of k, namely 5, 10, 11 and 20, so a(22) = 4.
%t Block[{nn = 85, s}, s = Array[Union@ NestWhileList[# + IntegerReverse@ # &, #, # < nn &, 1, nn] &, nn]; Array[Count[Take[s, # - 1], #, 2] &, nn + 1, 0]] (* _Michael De Vlieger_, Feb 01 2018 *)
%o (PARI) a(n) = my(i=0); for(k=1, n-1, my(x=k); while(x < n, x=x+eval(concat(Vecrev(Str(x))))); if(x==n, i++)); i
%Y Cf. A056964, A067030, A067031, A243238.
%K nonn,base
%O 0,5
%A _Felix Fröhlich_, Jan 30 2018