%I
%S 2,1,4,1,6,3,8,1,10,5,11,5,12,3,14,7,16,1,18,9,22,5
%N Twocolumn array A(n,s) of pairs (n,s) read by row where s is the smallest seed number such that the Reverse and Add! trajectory of s contains n (excluding cases where n=s).
%C Array begins:
%C 2 1
%C 4 1
%C 6 3
%C 8 1
%C 10 5
%C 11 5
%C 12 3
%C 14 7
%C 16 1
%C 18 9
%C 22 5
%H Felix FrÃ¶hlich, <a href="/A243824/a243824_1.txt">C++ program for this sequence</a>
%e A(10,1)=16 is in the array because 16 is the 9th number appearing in the Reverse and Add! trajectory of a smaller number.
%e A(10,2)=1 is in the array because 1 + 1 = 2, 2 + 2 = 4, 4 + 4 = 8, 8 + 8 = 16, so 1 is the smallest seed number whose Reverse and Add! trajectory contains 16.
%Y Cf. A006960, A023109, A033665, A063048, A070788, A077594.
%K nonn,base,tabf
%O 2,1
%A _Felix FrÃ¶hlich_, Jun 11 2014
