cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

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.).

Original entry on oeis.org

12, 13, 15, 17, 106, 107, 108, 109, 1099
Offset: 1

Views

Author

Amarnath Murthy, Aug 30 2002

Keywords

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

Examples

			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.
		

Crossrefs

Cf. A074163.

Programs

  • 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
    				

Extensions

Edited by Sascha Kurz, Jan 15 2003
Edited by N. J. A. Sloane at the suggestion of Andrew S. Plewe, May 21 2007
Showing 1-1 of 1 results.