# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a110725
Showing 1-1 of 1

%I A110725 #12 Nov 10 2017 13:33:24
%S A110725 0,2,4,6,8,10,12,14,16,18,101,202,303,404,505,606,707,808,909,1010,
%T A110725 202,303,404,505,606,707,808,909,1010,1111,303,404,505,606,707,808,
%U A110725 909,1010,1111,1212,404,505,606,707,808,909,1010,1111,1212,1313,505
%N A110725 [{n concatenate R(n)} + {R(n) concatenate n}]/11, where R(n) = digit reversal of n.
%H A110725 G. C. Greubel, <a href="/A110725/b110725.txt">Table of n, a(n) for n = 0..1000</a>
%F A110725 A110724(n)/11.
%F A110725 When n has one digit, a(n)=2*n. When n has two digits, a(n)= 101*x + 101*y. (Here x,y are the digits of n.). - _Keith Schneider_, Jun 16 2007
%e A110725 a(12) = {1221 + 2112}/11 = 303. a(68) = {6886 + 8668}/11 = 1414.
%t A110725 Table[(FromDigits[Join[IntegerDigits[n], Reverse[IntegerDigits[n]]]] + FromDigits[Join[Reverse[IntegerDigits[n]], IntegerDigits[n]]])/11, {n, 0, 50}] (* _Stefan Steinerberger_, Jun 17 2007 *)
%t A110725 cr[n_]:=Module[{r=IntegerReverse[n]},(n*10^IntegerLength[n]+r+ r*10^ IntegerLength[ n]+n)/11]; Array[cr,60,0] (* _Harvey P. Dale_, Nov 10 2017 *)
%Y A110725 Cf. A110722, A110723, A110724.
%K A110725 base,nonn,less,easy
%O A110725 0,2
%A A110725 _Amarnath Murthy_, Aug 09 2005
%E A110725 Corrected and extended by _Stefan Steinerberger_, Jun 17 2007

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE