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 #5 Mar 30 2012 17:27:34
%S 0,1,1,3,1,5,5,3,7,1,9,20,30,40,50,60,70,80,90,100,91,92,93,120,94,95,
%T 130,96,97,140,98,90,150,200,160,210,170,220,180,230,190,240,250,300,
%U 260,310,270,320,280,330,290,340,350,400,360,410,370,420,380,430,390
%N a(n) = largest integer k such that k is not of the form m + reverse(m) for any m (cf. A067031) and A067030(n) occurs in the 'Reverse and Add' trajectory of k.
%C a(n) <= A067034(n). If A067034(n) is in A067030 then a(n) < A067034(n), otherwise a(n) = A067034(n).
%H <a href="/index/Res#RAA">Index entries for sequences related to Reverse and Add!</a>
%e a(14) = 50, since A067030(14) = 55 and the five integers 7, 23, 32, 41, 50 are not of the form m + reverse(m) for any m, 55 occurs in the trajectory of each of them and 50 is the largest one. a(25) = 95, since A067030(25) = 154 and the eleven integers 1, 25, 34, 43, 52, 59, 61, 68, 70, 86, 95 are not of the form m + reverse(m) for any m, 154 occurs in the trajectory of each of them and 95 is the largest one.
%Y Cf. A067030, A067031, A067034, A067284, A067285.
%K base,nonn
%O 0,4
%A _Klaus Brockhaus_, Feb 04 2002