The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A094676 a(n) = least number m such that the quotient m/n is obtained merely by shifting the leftmost digit of m to the right end and the second digit of m is not zero. 7
 1, 210526315789473684, 3103448275862068965517241379, 410256, 510204081632653061224489795918367346938775, 6101694915254237288135593220338983050847457627118644067796, 7101449275362318840579, 8101265822784, 91011235955056179775280898876404494382022471 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Here when the leftmost digit of m is shifted to the right end the number of digits may not decrease - compare A097717. Least n-transposable number. A k-transposable number, 1<=k<=9, is one which is k times the number obtained when the leftmost digit is moved to the end. REFERENCES H. Camous, Jouer Avec Les Maths, "Chassez le naturel", Section I, Problem 3 pp. 20;31-2, Les Editions D'Organisation, Paris 1984. L. A. Graham, Ingenious Mathematical Problems and Methods, "End At The Beginning", Problem 72 pp. 44;212-3 Dover NY 1959. LINKS FORMULA a(n) = n prepended to n*(10^m - n)/(10*n - 1), where m=A094224(n)-1. EXAMPLE a(4)=410256=4*102564 CROSSREFS Cf. A097717. A249596-A249599. Sequence in context: A308287 A295740 A270271 * A327760 A054213 A288288 Adjacent sequences:  A094673 A094674 A094675 * A094677 A094678 A094679 KEYWORD fini,nonn,base,full AUTHOR Lekraj Beedassy, Jun 07 2004 EXTENSIONS Edited by N. J. A. Sloane, Apr 13 2009 STATUS approved

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

Last modified July 23 19:00 EDT 2021. Contains 346259 sequences. (Running on oeis4.)