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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089320 a(1) = 1, a(n) = smallest multiple of n using nonzero digits beginning with the digit reversal of a(n-1), if n is not == 0 (mod 10), else a(10^r*k) =10^r*{digit Reversal of a(10^r*k-1)}. 1

%I #4 Dec 05 2013 19:56:35

%S 1,12,21,12,215,5124,42154,451248,8421543,34512480,84215439,93451248,

%T 842154391,1934512482,284215439115,51193451248224,422842154391154,

%U 4511934512482248,842284215439115425,5245119345124822480

%N a(1) = 1, a(n) = smallest multiple of n using nonzero digits beginning with the digit reversal of a(n-1), if n is not == 0 (mod 10), else a(10^r*k) =10^r*{digit Reversal of a(10^r*k-1)}.

%Y Cf. A089321.

%K base,easy,nonn

%O 1,2

%A _Amarnath Murthy_, Nov 03 2003

%E More terms from _David Wasserman_, Sep 09 2005

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 14:50 EDT 2024. Contains 371792 sequences. (Running on oeis4.)