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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A140288 The least n-digit multiple of 5^n using the decimal digits {1, 2, 3, 4, 5} exclusively. 2
 5, 25, 125, 3125, 53125, 453125, 4453125, 14453125, 314453125, 2314453125, 22314453125, 122314453125, 4122314453125, 44122314453125, 444122314453125, 4444122314453125, 54444122314453125, 254444122314453125, 1254444122314453125, 21254444122314453125 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Alois P. Heinz, Table of n, a(n) for n = 1..1000 FORMULA To obtain the (n+1)-th term, write the n-th term as k * 5^n. Multiply k by a multiple of 2^n to get a multiple of 5. Add the multiplicator of 2^n to the left of the n-th term. EXAMPLE a(5) = 53125 = 17 * 5^5. PROG (PARI) lista(nn) = {v = vector(nn); v[1] = 5; for(k = 2, nn, j = 1; while((j*10^(k-1) + v[k-1]) % 5^k > 0, j++); v[k] = j*10^(k-1) + v[k-1]); for(k = 1, nn, print1(v[k], ", ")); } \\ Jinyuan Wang, Aug 27 2019 CROSSREFS Cf. A053312, A035014. Sequence in context: A113996 A340538 A062875 * A306570 A061835 A321288 Adjacent sequences:  A140285 A140286 A140287 * A140289 A140290 A140291 KEYWORD nonn,base AUTHOR Michel Criton (mcriton(AT)wanadoo.fr), May 24 2008 EXTENSIONS More terms from Alois P. Heinz, Apr 05 2017 STATUS approved

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 August 8 14:52 EDT 2022. Contains 356009 sequences. (Running on oeis4.)