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!)
 A187090 Smallest multiple of n beginning with 9. 2
 9, 90, 9, 92, 90, 90, 91, 96, 9, 90, 99, 96, 91, 98, 90, 96, 901, 90, 95, 900, 903, 902, 92, 96, 900, 910, 918, 924, 928, 90, 93, 96, 99, 918, 910, 900, 925, 912, 936, 920, 902, 924, 903, 924, 90, 92, 94, 96, 98, 900, 918, 936, 901, 918, 935 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(n) is in {n, 2n, 3n, 4n, 5n, 6n, 7n, 8n, 9n, 11n, 12n, 13n, 14n, 15n, 16n, 17n, 18n, 21n, 22n, 23n, 24n, 25n, 26n, 27n, 31n, 32n, 33n, 34n, 35n, 36n, 41n, 42n, 43n, 44n, 45n, 51n, 52n, 53n, 54n, 61n, 62n, 63n, 71n, 72n, 81n}. [Charles R Greathouse IV, Mar 06 2011] LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 MATHEMATICA f[n_] := Block[{m = n}, While[ First@ IntegerDigits@ m != 9, m += n]; m]; Array[f, 55] PROG (PARI) a(n)=forstep(k=n, 81*n, n, if(Vec(Str(k))[1]=="9", return(k))) \\ Charles R Greathouse IV, Mar 06 2011 (Haskell) a187090 n = until ((== 9) . a000030) (+ n) n -- Reinhard Zumkeller, Mar 27 2012 CROSSREFS Cf. A082811, A082792, A082794, A082795, A082796, A082797, A082798. Cf. A000030. Sequence in context: A258388 A296618 A230114 * A078248 A186943 A217402 Adjacent sequences:  A187087 A187088 A187089 * A187091 A187092 A187093 KEYWORD nonn,easy,base AUTHOR Robert G. Wilson v, Mar 06 2011 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 August 1 13:55 EDT 2021. Contains 346391 sequences. (Running on oeis4.)