

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




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



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..NhiNlo+1)]: for n from Nlo to Nhi do while k<Khi and s(d(k))<=n*k do k := k+1 od: A[nNlo+1] := k; od: return A; end proc; # Francois Jooste (phukraut(AT)hotmail.com), Oct 23 2002


CROSSREFS



KEYWORD

base,nonn,fini,full


AUTHOR



EXTENSIONS



STATUS

approved



