The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A160927 a(n) = n + reversal(n-1). 1

%I #9 May 05 2022 16:19:25

%S 1,3,5,7,9,11,13,15,17,19,12,23,34,45,56,67,78,89,100,111,23,34,45,56,

%T 67,78,89,100,111,122,34,45,56,67,78,89,100,111,122,133,45,56,67,78,

%U 89,100,111,122,133,144,56,67,78,89,100,111,122,133,144,155,67,78,89,100

%N a(n) = n + reversal(n-1).

%C a(8) = 8 + R(7) = 8 + 7 = 15;

%C a(15) = 15 + R(14) = 15 + 41 = 56;

%C a(26) = 26 + R(25) = 26 + 52 = 78.

%H Harvey P. Dale, <a href="/A160927/b160927.txt">Table of n, a(n) for n = 1..1000</a>

%p rev := proc (n) local nn: nn := convert(n, base, 10): add(nn[j]*10^(nops(nn)-j), j = 1 .. nops(nn)) end proc: seq(n+rev(n-1), n = 1 .. 55); # _Emeric Deutsch_, Jun 22 2009

%t Table[n+IntegerReverse[n-1],{n,70}] (* _Harvey P. Dale_, May 05 2022 *)

%K nonn,base

%O 1,2

%A _Claudio Meller_, May 30 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 29 20:48 EST 2024. Contains 370428 sequences. (Running on oeis4.)