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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082796 Smallest multiple of n beginning with 6. 8
6, 6, 6, 60, 60, 6, 63, 64, 63, 60, 66, 60, 65, 602, 60, 64, 68, 612, 608, 60, 63, 66, 69, 600, 600, 624, 621, 616, 609, 60, 62, 64, 66, 68, 630, 612, 629, 608, 624, 600, 615, 630, 602, 616, 630, 644, 611, 624, 637, 600, 612, 624, 636, 648, 605, 616, 627, 638 (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, 31n, 32n, 33n, 34n, 35n, 41n, 42n, 43n, 51n, 52n}. - 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 != 6, m += n]; m]; Array[f, 55] (* Robert G. Wilson v *)

PROG

(PARI) a(n)=forstep(k=n, 52*n, n, if(Vec(Str(k))[1]=="6", return(k))) \\ Charles R Greathouse IV, Mar 06 2011

(Haskell)

a082796 n = until ((== 6) . a000030) (+ n) n

-- Reinhard Zumkeller, Mar 27 2012

(Python)

def a(n):

    m = n

    while str(m)[0] != '6': m += n

    return m

print([a(n) for n in range(1, 59)]) # Michael S. Branicky, Jun 06 2021

CROSSREFS

Cf. A082794, A082795, A082797, A082798.

Cf. A000030.

Sequence in context: A245100 A024953 A092281 * A078245 A241057 A247253

Adjacent sequences:  A082793 A082794 A082795 * A082797 A082798 A082799

KEYWORD

base,easy,nonn

AUTHOR

Amarnath Murthy, Apr 20 2003

EXTENSIONS

More terms from Sean A. Irvine, 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 21 16:47 EDT 2021. Contains 345365 sequences. (Running on oeis4.)