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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A074164 Smallest k such that R(k) > n*k, where R(k) is the digit reversal of k (A004086) (the reversal of 10 is taken to be 01 = 1, etc.). 2
 12, 13, 15, 17, 106, 107, 108, 109, 1099 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS As R(k) doesn't increase the number of digits, R(k)<10k and so the sequence is complete. - Sascha Kurz, Jan 15 2003 LINKS Table of n, a(n) for n=1..9. EXAMPLE a(3) = 15, 51 > 3*15, a(3) is not 14 as 41 < 42 = 3*14. a(12) = 430 > 12*34. a(4) = 17 as 71 > 17*4 but 61 is < 16*4. MAPLE P := proc(Nlo, Nhi, Klo, Khi) local A::list, k, n, d, s; d := (X::posint)->convert(X, base, 10):s := (L::list)->sum(L[i]*10^(nops(L)-i), i=1..nops(L)):k := Klo:A := [seq(0, i=1..Nhi-Nlo+1)]: for n from Nlo to Nhi do while k

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 July 25 14:28 EDT 2024. Contains 374609 sequences. (Running on oeis4.)